We propose and experimentally realize an algorithmic benchmark that demonstrates coherent control with a sequence of quantum operations that first generates and then decodes the cat state (|000...>+|111...>)/sqrt(2) to the standard initial state |000...>. This is the first high fidelity experimental quantum algorithm on the currently largest physical quantum register, which has seven quantum bits (qubits) provided by the nuclei of crotonic acid. The experiment has the additional benefit of verifying a seven coherence in a generic system of coupled spins. Our implementation combines numerous nuclear magnetic resonance (NMR) techniques in one experiment and introduces practical methods for translating quantum networks to control operations. The experimental procedure can be used as a reliable and efficient method for creating a standard pseudo-pure state, the first step for implementing traditional quantum algorithms in liquid state NMR. The benchmark and the techniques can be adapted for use on other proposed quantum devices.
As one of the most prominent subfields of quantum communication research, remote state preparation (RSP) plays a crucial role in quantum networks. Here we present a deterministic remote state preparation scheme to prepare an arbitrary two-qubit state via a seven-qubit entangled channel created from Borras \emph{et al.} state. Quantum noises are inherent to each and every protocol for quantum communication that is currently in use, putting the integrity of quantum communication systems and their dependability at risk. The initial state of the system was a pure quantum state, but as soon as ther…
We study quantum information properties of a seven-level system realized by a particle in an one-dimensional square-well trap. Features of encodings of seven-level systems in a form of three-qubit or qubit-qutrit systems are discussed. We use the three-qubit encoding of the system in order to investigate subadditivity and strong subadditivity conditions for the thermal state of the particle. The qubit-qutrit encoding is employed to suggest a single qudit algorithm for calculation of parity of a bit string. Obtained results indicate on the potential resource of multilevel systems for realizatio…
Using unstable particles which decay by emitting neutrinos, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrinos carry away quantum information, but their interaction with matter is so weak that it would take an astronomically-sized machine just to catch them, not to mention performing controlled unitary operations on them. As a result quantum information is lost, and cheating is not possible even if the participants had access to the most powerful quantum computers that could ever be built. Therefore, for all practical purposes, our new protocol is as go…
In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Crépeau, Jozsa and Langlois (BCJL). The intuition behind their attack is correct, and indeed they expose a weakness common to all proposals of a certain kind, but the BCJL protocol does not fall in this category. Nevertheless, it is true that the BCJL protocol is insecure, but the required attack and proof are more subtle. Here we provide the first complete proof that the BCJL protocol is insecure.
We show how weak non-linearities can be used in a device-independent quantum key distribution (QKD) protocol using generalized two-mode Schrödinger cat states. The QKD protocol is therefore shown to be secure against collective attacks and for some coherent attacks. We derive analytical formulas for the optimal values of the Bell parameter, the quantum bit error rate, and the device-independent secret key rate in the noiseless lossy bosonic channel. Additionally, we give the filters and measurements which achieve these optimal values. We find that over any distance in this channel the quantum …
We consider possible non-signaling composites of probabilistic models based on euclidean Jordan algebras. Subject to some reasonable constraints, we show that no such composite exists having the exceptional Jordan algebra as a direct summand. We then construct several dagger compact categories of such Jordan-algebraic models. One of these neatly unifies real, complex and quaternionic mixed-state quantum mechanics, with the exception of the quaternionic "bit". Another is similar, except in that (i) it excludes the quaternionic bit, and (ii) the composite of two complex quantum systems comes wit…
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a single-step implementation of arbitrary $n$-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to $n$ other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits…
