We present a family of quantum error-correcting codes that support a universal set of transversal logic gates using only local operations on a two-dimensional array of physical qubits. The construction is a subsystem version of color codes where gaug
e fixing through local measurements dynamically determines which gates are transversal. Although the operations are local, the underlying code is not topological in structure, which is how the construction circumvents no-go constraints imposed by the Bravyi-Konig and Pastawski-Yoshida theorems. We provide strong evidence that the encoding has no error threshold in the conventional sense, though it is still possible to have logical gates with error probability much lower than that of physical gates.
We show that qubits traveling along closed timelike curves are a resource that a party can exploit to distinguish perfectly any set of quantum states. As a result, an adversary with access to closed timelike curves can break any prepare-and-measure q
uantum key distribution protocol. Our result also implies that a party with access to closed timelike curves can violate the Holevo bound.
Decoy state protocols are a useful tool for many quantum key distribution systems implemented with weak coherent pulses, allowing significantly better secret bit rates and longer maximum distances. In this paper we present a method to numerically fin
d optimal three-level protocols, and we examine how the secret bit rate and the optimized parameters are dependent on various system properties, such as session length, transmission loss, and visibility. Additionally, we show how to modify the decoy state analysis to handle partially distinguishable decoy states as well as uncertainty in the prepared intensities.
We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We provide equivale
nce transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.
We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors.
We describe a phase transition for long-range entanglement in a three-dimensional cluster state affected by noise. The partially decohered state is modeled by the thermal state of a suitable Hamiltonian. We find that the temperature at which the enta
nglement length changes from infinite to finite is nonzero. We give an upper and lower bound to this transition temperature.
We study the +/- J random-plaquette Z_2 gauge model (RPGM) in three spatial dimensions, a three-dimensional analog of the two-dimensional +/- J random-bond Ising model (RBIM). The model is a pure Z_2 gauge theory in which randomly chosen plaquettes (
occuring with concentration p) have couplings with the ``wrong sign so that magnetic flux is energetically favored on these plaquettes. Excitations of the model are one-dimensional ``flux tubes that terminate at ``magnetic monopoles. Electric confinement can be driven by thermal fluctuations of the flux tubes, by the quenched background of magnetic monopoles, or by a combination of the two. Like the RBIM, the RPGM has enhanced symmetry along a ``Nishimori line in the p-T plane (where T is the temperature). The critical concentration p_c of wrong-sign plaquettes at the confinement-Higgs phase transition along the Nishimori line can be identified with the accuracy threshold for robust storage of quantum information using topological error-correcting codes: if qubit phase errors, qubit bit-flip errors, and errors in the measurement of local check operators all occur at rates below p_c, then encoded quantum information can be protected perfectly from damage in the limit of a large code block. Numerically, we measure p_{c0}, the critical concentration along the T=0 axis (a lower bound on p_c), finding p_{c0}=.0293 +/- .0002. We also measure the critical concentration of antiferromagnetic bonds in the two-dimensional RBIM on the T=0 axis, finding p_{c0}=.1031 +/-.0001. Our value of p_{c0} is incompatible with the value of p_c=.1093 +/-.0002 found in earlier numerical studies of the RBIM, in disagreement with the conjecture that the phase boundary of the RBIM is vertical (parallel to the T axis) below the Nishimori line.
We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in the phase s
pace of 2N canonical variables. From the existence of symplectically integral lattices with suitable properties, we infer a lower bound on the quantum capacity of the Gaussian quantum channel that matches the one-shot coherent information optimized over Gaussian input states.
