Related papers: Escape from the Quantum Pigeon Conundrum
The physical concept of quantum entanglement is brought to the biological domain. We simulate the cooperation of two insects by hypothesizing that they share a large number of quantum entangled spin-1/2 particles. Each of them makes…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
We obtain some rigorous results on limit theorems for quantum walks driven by many coins introduced by Brun et al. in the long time limit. The results imply that whether the behavior of a particle is quantum or classical depends on the…
A significant obstacle for practical quantum computation is the loss of physical qubits in quantum computers, a decoherence mechanism most notably in optical systems. Here we experimentally demonstrate, both in the quantum circuit model and…
A major signature of quantum mechanics beyond classical physics is coherence, the existence of superposition states. The recently developed resource theory of quantum coherence allows the formalisation of incoherent operations -- those…
The infinite pigeonhole principle for 2-partitions asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we develop a new notion of forcing enabling a fine analysis of the…
In this talk I will show that the two-Higgs doublet model with vacuum CP violation and approximate global $U(1)$ family symmetries may provide one of the simplest and most attractive models for understanding the origin and mechanisms of CP…
From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the first $\epsilon$-simulatable two-party computation (2PC) against quantum polynomial-time (QPT) adversaries that is both constant-round and black-box…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
One of the fundamental theories of physics is that of quantum mechanics. Quantum mechanics tries to explain the inconsistencies in the behaviors of systems at the macro and micro scales. Quantum mechanics paved the way for quantum computing…
Criteria are given by which dissipative evolution can transfer populations and coherences between quantum subspaces, without a loss of coherence. This results in a form of quantum error correction that is implemented by the joint evolution…
After briefly explaining the special role played by violations of CP and T invariance and their connection with the baryon number of the Universe, I sketch the history of CP violation studies since its totally unexpected discovery in 1964.…
A brief review of the strategies used in looking for CP violation in B decays is presented. Some problems due to penguin diagrams are addressed. Penguin trapping is discussed, in the context of the upcoming experiments. The high rates and…
The point of building a quantum computer is that it allows to model living things with predictive power and gives the opportunity to control life. Its scaling means not just the improvement of the instrument part, but also, mainly,…
The concept of multiple particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantum communication channel or a quantum computer.…
In multiparticle quantum interference, bosons show rather generally the tendency to bunch together, while fermions can not. This behavior, which is rooted in the different statistics of the particles, results in a higher coincidence rate…
The quon algebra gives a description of particles, ``quons,'' that are neither fermions nor bosons. The parameter $q$ attached to a quon labels a smooth interpolation between bosons, for which $q = +1$, and fermions, for which $q = -1$.…
Fault-tolerant quantum computers rely on Quantum Error-Correcting Codes (QECCs) to protect information from noise. However, no single error-correcting code supports a fully transversal and therefore fault-tolerant implementation of all…
The space P of pure states of any physical system, classical or quantum, is identified as a Poisson space with a transition probability. The latter is a function p: PxP -> [0,1]; in addition, a Poisson bracket is defined for functions on P.…
Three postulates are discussed: first that well-defined properties cannot be assigned to an isolated system, secondly that quantum unitary evolution is atemporal, and thirdly that some physical processes are never reversed. It is argued…