Long distance coupling of a quantum mechanical oscillator to the internal states of an atomic ensemble

We propose and investigate a hybrid optomechanical system consisting of a micro-mechanical oscillator coupled to the internal states of a distant ensemble of atoms. The interaction between the systems is mediated by a light field which allows the coupling of the two systems in a modular way over long distances. Coupling to internal degrees of freedom of atoms opens up the possibility to employ high-frequency mechanical resonators in the MHz to GHz regime, such as optomechanical crystal structures, and to benefit from the rich toolbox of quantum control over internal atomic states. Previous schemes involving atomic motional states are rather limited in both of these aspects. We derive a full quantum model for the effective coupling including the main sources of decoherence. As an application we show that sympathetic ground-state cooling and strong coupling between the two systems is possible.

Batch Verification of Validity of Bids in Homomorphic E-auction

Bid opening in e-auction is efficient when a homomorphic secret sharing function is employed to seal the bids and homomorphic secret reconstruction is employed to open the bids. However, this high efficiency is based on an assumption: the bids are valid (e.g., within a special range). An undetected invalid bid can compromise correctness and fairness of the auction. Unfortunately, validity verification of the bids is ignored in the auction schemes employing homomorphic secret sharing (called homomorphic auction in this paper). In this paper, an attack against the homomorphic auction in the absence of bid validity check is presented and a necessary bid validity check mechanism is proposed. Then a batch cryptographic technique is introduced and applied to improve the efficiency of bid validity check.

G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage

Protocols for secure archival storage are becoming increasingly important as the use of digital storage for sensitive documents is gaining wider practice. Wong et al.[8] combined verifiable secret sharing with proactive secret sharing without reconstruction and proposed a verifiable secret redistribution protocol for long term storage. However their protocol requires that each of the receivers is honest during redistribution. We proposed[3] an extension to their protocol wherein we relaxed the requirement that all the recipients should be honest to the condition that only a simple majority amongst the recipients need to be honest during the re(distribution) processes. Further, both of these protocols make use of Feldman's approach for achieving integrity during the (redistribution processes. In this paper, we present a revised version of our earlier protocol, and its adaptation to incorporate Pedersen's approach instead of Feldman's thereby achieving information theoretic secrecy while retaining integrity guarantees.

Non-destructive discrimination of Bell states by NMR using a single ancilla qubit

Discrimination of Bell states plays an important role in a number of quantum computational protocols such as teleportation and secret sharing. However, most of the protocols dealing with Bell state discrimination in the literature either involve performing correlated measurements or destroying the entanglement of the system. Here, we demonstrate an NMR-based experimental realization of a protocol for Bell state discrimination, following a scheme proposed by Gupta et al (quant-ph/0504183v1, 23 April 2005), which does not destroy the Bell state under consideration. Using the proposed protocol, one can deterministically distinguish the Bell states, without performing a measurement using the entangled basis. State discrimination is performed through two independent measurements on one ancilla qubit, which leaves the Bell states unchanged.

Determinants of Profit Sharing in the Finnish Sector

This study investigates the role of factors that determine individual employee’s and firms participation in profit sharing schemes. Using a large panel data of Finnish employees for the period 1996-2000 we analyse individual and workplace characteristics that make firms employ profit sharing schemes and workers susceptible of receiving profit sharing bonuses. In particular two links between profit sharing schemes and workers performance have been analysed. First, in looking at profit sharing as an incentive device the results show a positive link between firm size and monitoring costs. Second, we find that younger individuals with higher mean salary and capacity to bear risk are more susceptible to profit sharing schemes. The industrial sector in which the individual is employed is also an important determinant factor. We find weak evidence of a relationship between performance of firms and employment of profit sharing schemes at the industrial sector level.

An extended verifiable secret redistribution protocol for archival systems

Existing protocols for archival systems make use of verifiability of shares in conjunction with a proactive secret sharing scheme to achieve high availability and long term confidentiality, besides data integrity. In this paper, we extend an existing protocol (Wong et al. [9]) to take care of more realistic situations. For example, it is assumed in the protocol of Wong et al. that the recipients of the secret shares are all trustworthy; we relax this by requiring that only a majority is trustworthy.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).

Hybrid Qm/Mm Simulation Of The Hydration Phenomena Of Dipalmitoylphosphatidylcholine Headgroup

The polar headgroup of dipalmitoylphosphatidylcholine (DPPC) molecule both in gas phase and aqueous Solution is investigated by the hybrid quantum mechanical/molecular mechanical (QM/MM) method, in which the polar head of DPPC molecule and the bound water molecules are treated with density functional theory (DFT), while the apolar hydrocarbon chain of DPPC molecule is treated with MM method. It is demonstrated that the hybrid QM/MM method is both accurate and efficient to describe the conformations of DPPC headgroup. Folded structures of headgroup are found in gas phase calculations. In this work, both monohydration and polyhydration phenomena are investigated. In monohydration, different water association sites are studied. Both the hydration energy and the quantum properties of DPPC and water molecules are calculated at the DFT level of theory after geometry optimization. The binding force of monohydration is estimated by using the scan method. In polyhydration, more extended conformations are found and hydration energies in different polyhydration styles are estimated. (C) 2008 Elsevier Inc. All rights reserved.

Lattice quantum codes and exotic topological phases of matter

This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for fault-tolerant quantum information processing have been developed so far, one of which, called topological quantum computation, makes use of degrees of freedom that are inherently insensitive to local errors. However, this scheme is not so reliable against thermal errors. Other fault-tolerant schemes achieve better reliability through active error correction, but incur a substantial overhead cost. Thus, it is of practical importance and theoretical interest to design and assess fault-tolerant schemes that work well at finite temperature without active error correction.

In this thesis, a three-dimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite temperature is possible, at least to some extent. When quantum information is encoded into a highly entangled ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time which grows exponentially with the square of the inverse temperature. In contrast, for previously known types of topological quantum storage in three or fewer spatial dimensions the memory time scales exponentially with the inverse temperature, rather than its square.

This spin model exhibits a previously unexpected topological quantum order, in which ground states are locally indistinguishable, pointlike excitations are immobile, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated number-theoretic function of the system size, and the system bifurcates into multiple noninteracting copies of itself under real-space renormalization group transformations. The degeneracy, the excitations, and the renormalization group flow can be analyzed using a framework that exploits the spin model's symmetry and some associated free resolutions of modules over polynomial algebras.

Practical and Foundational Aspects of Secure Computation

Il y a des problemes qui semblent impossible a resoudre sans l'utilisation d'un tiers parti honnete. Comment est-ce que deux millionnaires peuvent savoir qui est le plus riche sans dire a l'autre la valeur de ses biens ? Que peut-on faire pour prevenir les collisions de satellites quand les trajectoires sont secretes ? Comment est-ce que les chercheurs peuvent apprendre les liens entre des medicaments et des maladies sans compromettre les droits prives du patient ? Comment est-ce qu'une organisation peut ecmpecher le gouvernement d'abuser de l'information dont il dispose en sachant que l'organisation doit n'avoir aucun acces a cette information ? Le Calcul multiparti, une branche de la cryptographie, etudie comment creer des protocoles pour realiser de telles taches sans l'utilisation d'un tiers parti honnete. Les protocoles doivent etre prives, corrects, efficaces et robustes. Un protocole est prive si un adversaire n'apprend rien de plus que ce que lui donnerait un tiers parti honnete. Un protocole est correct si un joueur honnete recoit ce que lui donnerait un tiers parti honnete. Un protocole devrait bien sur etre efficace. Etre robuste correspond au fait qu'un protocole marche meme si un petit ensemble des joueurs triche. On demontre que sous l'hypothese d'un canal de diusion simultane on peut echanger la robustesse pour la validite et le fait d'etre prive contre certains ensembles d'adversaires. Le calcul multiparti a quatre outils de base : le transfert inconscient, la mise en gage, le partage de secret et le brouillage de circuit. Les protocoles du calcul multiparti peuvent etre construits avec uniquements ces outils. On peut aussi construire les protocoles a partir d'hypoth eses calculatoires. Les protocoles construits a partir de ces outils sont souples et peuvent resister aux changements technologiques et a des ameliorations algorithmiques. Nous nous demandons si l'efficacite necessite des hypotheses de calcul. Nous demontrons que ce n'est pas le cas en construisant des protocoles efficaces a partir de ces outils de base. Cette these est constitue de quatre articles rediges en collaboration avec d'autres chercheurs. Ceci constitue la partie mature de ma recherche et sont mes contributions principales au cours de cette periode de temps. Dans le premier ouvrage presente dans cette these, nous etudions la capacite de mise en gage des canaux bruites. Nous demontrons tout d'abord une limite inferieure stricte qui implique que contrairement au transfert inconscient, il n'existe aucun protocole de taux constant pour les mises en gage de bit. Nous demontrons ensuite que, en limitant la facon dont les engagements peuvent etre ouverts, nous pouvons faire mieux et meme un taux constant dans certains cas. Ceci est fait en exploitant la notion de cover-free families . Dans le second article, nous demontrons que pour certains problemes, il existe un echange entre robustesse, la validite et le prive. Il s'effectue en utilisant le partage de secret veriable, une preuve a divulgation nulle, le concept de fantomes et une technique que nous appelons les balles et les bacs. Dans notre troisieme contribution, nous demontrons qu'un grand nombre de protocoles dans la litterature basee sur des hypotheses de calcul peuvent etre instancies a partir d'une primitive appelee Transfert Inconscient Veriable, via le concept de Transfert Inconscient Generalise. Le protocole utilise le partage de secret comme outils de base. Dans la derniere publication, nous counstruisons un protocole efficace avec un nombre constant de rondes pour le calcul a deux parties. L'efficacite du protocole derive du fait qu'on remplace le coeur d'un protocole standard par une primitive qui fonctionne plus ou moins bien mais qui est tres peu couteux. On protege le protocole contre les defauts en utilisant le concept de privacy amplication .

Mandatory profit sharing, entrepreneurial incentives and capital accumulation

The impact of a mandatory tax on profits which is transferred to workers is analyzed in a general equilibrium entrepreneurial model. In the short run, this distortion reduces the number of firms and the aggregate output. In the long run, if capital and labor are bad substitutes, it fosters capital accumulation and increases the aggregate output. In a small open economy with free movement of capital, it improves the welfare of the economy's average individual. One concludes that the benefits of sharing schemes may go beyond the short run employment-stabilization goal focused by the profit sharing literature.

Mandatory profit sharing, entrepreneurial incentives and capital accumulation

The impact of a mandatory tax on profits which is transferred to workers is analyzed in a general equilibrium entrepreneurial model. In the short run, this distortion reduces the number of fmns and the aggregate output. In the long run, if capital and labor are bad substitutes, it fosters capital accumulation and increases the aggregate output. In a small open economy with free movement of capital, it improves the welfare of the economy's average individual. One concludes that the benefits of sharing schemes may go beyond the short run employment-stabilization goal focused by the profit sharing literature.

Spectroscopic properties from hybrid QM, MM molecular dynamics simulation

The central aim of this thesis work is the application and further development of a hybrid quantum mechanical/molecular mechanics (QM/MM) based approach to compute spectroscopic properties of molecules in complex chemical environments from electronic structure theory. In the framework of this thesis, an existing density functional theory implementation of the QM/MM approach is first used to calculate the nuclear magnetic resonance (NMR) solvent shifts of an adenine molecule in aqueous solution. The findings show that the aqueous solvation with its strongly fluctuating hydrogen bond network leads to specific changes in the NMR resonance lines. Besides the absolute values, also the ordering of the NMR lines changes under the influence of the solvating water molecules. Without the QM/MM scheme, a quantum chemical calculation could have led to an incorrect assignment of these lines. The second part of this thesis describes a methodological improvement of the QM/MM method that is designed for cases in which a covalent chemical bond crosses the QM/MM boundary. The development consists in an automatized protocol to optimize a so-called capping potential that saturates the electronic subsystem in the QM region. The optimization scheme is capable of tuning the parameters in such a way that the deviations of the electronic orbitals between the regular and the truncated (and "capped") molecule are minimized. This in turn results in a considerable improvement of the structural and spectroscopic parameters when computed with the new optimized capping potential within the QM/MM technique. This optimization scheme is applied and benchmarked on the example of truncated carbon-carbon bonds in a set of small test molecules. It turns out that the optimized capping potentials yield an excellent agreement of NMR chemical shifts and protonation energies with respect to the corresponding full molecules. These results are very promising, so that the application to larger biological complexes will significantly improve the reliability of the prediction of the related spectroscopic properties.

Optimal photons for quantum-information processing

Photonic quantum-information processing schemes, such as linear optics quantum computing, and other experiments relying on single-photon interference, inherently require complete photon indistinguishability to enable the desired photonic interactions to take place. Mode-mismatch is the dominant cause of photon distinguishability in optical circuits. Here we study the effects of photon wave-packet shape on tolerance against the effects of mode mismatch in linear optical circuits, and show that Gaussian distributed photons with large bandwidth are optimal. The result is general and holds for arbitrary linear optical circuits, including ones which allow for postselection and classical feed forward. Our findings indicate that some single photon sources, frequently cited for their potential application to quantum-information processing, may in fact be suboptimal for such applications.

Profit sharing, technical efficiency change and finance constraints

This paper analyses the mechanisms through which profit-sharing schemes may induce debt constrained firms to improve technical efficiency over time to guarantee positive profits. This hypothesis is first formalised in a partial equilibrium framework and then is tested on a sample of Italian traditional and cooperative firms. Technical efficiency change indexes are computed by DEA. These are regressed on a measure of finance constraints to analyse their impact on firms’ efficiency growth. The results support the hypothesis that a restriction in the availability of financial resources can affect positively the growth in efficiency in firms with profit-sharing schemes.