QUIE2T Quantum Information Entanglement-Enabled Technologies

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously best-known quantum protocol by Ambainis achieved a cheating probability of at most 3/4, while Kitaev showed that no quantum protocol can have cheating probability less than 1/sqrt{2}. Closing this gap has since been an important and open question. In this paper, the authors provide the optimal bound for quantum bit commitment.

We propose a method to prepare and verify spatial quantum superpositions of a nanometer-sized object separated by distances of the order of its size. This method provides unprecedented bounds for objective collapse models of the wave function by merging techniques and insights from cavity quantum optomechanics and matter-wave interferometry. An analysis and simulation of the experiment is performed taking into account standard sources of decoherence. We provide an operational parameter regime using present-day and planned technology.

The heat generated by computations is not only an obstacle to circuit miniaturization but also a fundamental aspect of the relationship between information theory and thermodynamics. In principle, reversible operations may be performed at no energy cost; given that irreversible computations can always be decomposed into reversible operations followed by the erasure of data, the problem of calculating their energy cost is reduced to the study of erasure. Landauer’s principle states that the erasure of data stored in a system has an inherent work cost and therefore dissipates heat.

The estimation of parameters characterizing dynamical processes is central to science and technology. The estimation error changes with the number N of resources employed in the experiment (which could quantify, for instance, the number of probes or the probing energy). Typically, it scales as . Quantum strategies may improve the precision, for noiseless processes, by an extra factor . For noisy processes, it is not known in general if and when this improvement can be achieved.

Metropolis algorithm is the standard method for the simulation of interacting particles on classical computers. In this work, the authors demonstrate how to implement a quantum version of the Metropolis algorithm on a quantum computer. This algorithm permits to sample directly from the eigenstates of the Hamiltonian and thus evades the sign problem present in classical simulations. A small scale implementation of this algorithm can already be achieved with today's technology.

We establish a link between unitary relaxation dynamics after a quench in closed many-body systems and the entanglement in the energy eigenbasis. We find that even if reduced states equilibrate, they can have memory on the initial conditions even in certain models that are far from integrable. We show that in such situations the equilibrium states are still described by a maximum entropy or generalized Gibbs ensemble, regardless of whether a model is integrable or not, thereby contributing to a recent debate.

We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode. This model is not known or believed to be universal for quantum computation, and indeed, we discuss the prospects for realizing the model using current technology.