arXiv subjects

John Preskill

Publications and source records attributed to John Preskill.

At least 109 records · Page 6Linked to original sources

arXiv2012

Optimal Bacon-Shor codes

We study the performance of Bacon-Shor codes, quantum subsystem codes which are well suited for applications to fault-tolerant quantum memory because the error syndrome can be extracted by performing two-qubit measurements. Assuming independent noise, we find the optimal block size in terms of the bit-flip error probability p_X and the phase error probability p_Z, and determine how the probability of a logical error depends on p_X and p_Z. We show that a single Bacon-Shor code block, used by itself without concatenation, can provide very effective protection against logical errors if the noise is highly biased (p_Z / p_X >> 1) and the physical error rate p_Z is a few percent or below. We also derive an upper bound on the logical error rate for the case where the syndrome data is noisy.

quant-ph↗

arXiv2012

Logical operator tradeoff for local quantum codes

We study the structure of logical operators in local D-dimensional quantum codes, considering both subsystem codes with geometrically local gauge generators and codes defined by geometrically local commuting projectors. We show that if the code distance is d, then any logical operator can be supported on a set of specified geometry containing \tilde d qubits, where \tilde d d^{1/(D-1)} = O(n) and n is the code length. Our results place limitations on partially self-correcting quantum memories, in which at least some logical operators are protected by energy barriers that grow with system size. We also show that for any two-dimensional local commuting projector code there is a nontrivial logical "string" operator supported on a narrow strip, where the operator is only slightly entangling across any cut through the strip.

quant-ph↗

arXiv2011

Quantum Algorithms for Quantum Field Theories

Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (phi-fourth theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.

quant-ph↗

arXiv2011

Combining dynamical decoupling with fault-tolerant quantum computation

We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to outperform unprotected gates. Under suitable conditions, fault-tolerant quantum circuits constructed from DD-protected gates can tolerate stronger noise, and have a lower overhead cost, than fault-tolerant circuits constructed from unprotected gates. Our accuracy estimates depend on the dynamics of the bath that couples to the quantum computer, and can be expressed either in terms of the operator norm of the bath's Hamiltonian or in terms of the power spectrum of bath correlations; we explain in particular how the performance of recursively generated concatenated pulse sequences can be analyzed from either viewpoint. Our results apply to Hamiltonian noise models with limited spatial correlations.

quant-ph↗

arXiv2011

Interface Between Topological and Superconducting Qubits

We propose and analyze an interface between a topological qubit and a superconducting flux qubit. In our scheme, the interaction between Majorana fermions in a topological insulator is coherently controlled by a superconducting phase that depends on the quantum state of the flux qubit. A controlled phase gate, achieved by pulsing this interaction on and off, can transfer quantum information between the topological qubit and the superconducting qubit.

cond-mat.mes-hall↗

arXiv2009

Fault-Tolerant Computing With Biased-Noise Superconducting Qubits

We present a universal scheme of pulsed operations for the IBM oscillator-stabilized flux qubit comprising the CPHASE gate, single-qubit preparations and measurements. Based on numerical simulations, we argue that the error rates for these operations can be as low as about .5% and that noise is highly biased, with phase errors being stronger than all other types of errors by a factor of nearly 10^3. In contrast, the design of a CNOT gate for this system with an error rate of less than about 1.2% seems extremely challenging. We propose a special encoding which exploits the noise bias allowing us to implement a logical CNOT gate where phase errors and all other types of errors have nearly balanced rates of about .4%. Our results illustrate how the design of an encoding scheme can be adjusted and optimized according to the available physical operations and the particular noise characteristics of experimental devices.

quant-ph↗

arXiv2008

The Fibonacci scheme for fault-tolerant quantum computation

We rigorously analyze Knill's Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of .67\times 10^{-3} for adversarial local stochastic noise, and 1.25\times 10^{-3} for independent depolarizing noise. In contrast to other schemes with comparable proved accuracy thresholds, the Fibonacci scheme has a significantly reduced overhead cost because it uses postselection far more sparingly.

quant-ph↗

arXiv2008

Fault-tolerant quantum computation against biased noise

We formulate a scheme for fault-tolerant quantum computation that works effectively against highly biased noise, where dephasing is far stronger than all other types of noise. In our scheme, the fundamental operations performed by the quantum computer are single-qubit preparations, single-qubit measurements, and conditional-phase (CPHASE) gates, where the noise in the CPHASE gates is biased. We show that the accuracy threshold for quantum computation can be improved by exploiting this noise asymmetry; e.g., if dephasing dominates all other types of noise in the CPHASE gates by four orders of magnitude, we find a rigorous lower bound on the accuracy threshold higher by a factor of five than for the case of unbiased noise.

quant-ph↗

arXiv2008

Fault-tolerant quantum computation versus Gaussian noise

We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quantum noise, and we show that scalable quantum computation is possible if the noise power spectrum satisfies an appropriate "threshold condition." Our condition is less sensitive to very-high-frequency noise than previously derived threshold conditions for non-Markovian noise.

quant-ph↗

arXiv2007

Black holes as mirrors: quantum information in random subsystems

We study information retrieval from evaporating black holes, assuming that the internal dynamics of a black hole is unitary and rapidly mixing, and assuming that the retriever has unlimited control over the emitted Hawking radiation. If the evaporation of the black hole has already proceeded past the "half-way" point, where half of the initial entropy has been radiated away, then additional quantum information deposited in the black hole is revealed in the Hawking radiation very rapidly. Information deposited prior to the half-way point remains concealed until the half-way point, and then emerges quickly. These conclusions hold because typical local quantum circuits are efficient encoders for quantum error-correcting codes that nearly achieve the capacity of the quantum erasure channel. Our estimate of a black hole's information retention time, based on speculative dynamical assumptions, is just barely compatible with the black hole complementarity hypothesis.

hep-th↗

arXiv2007

Accuracy threshold for postselected quantum computation

We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower bound on the accuracy threshold, 1.04 \times 10^{-3}, is well below Knill's numerical estimates.

quant-ph↗

arXiv2007

Security of quantum key distribution using weak coherent states with nonrandom phases

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the key information is encoded in the relative phase of a coherent-state reference pulse and a weak coherent-state signal pulse, as in some practical implementations of the protocol. In contrast to previous work, our proof applies even if the eavesdropper knows the phase of the reference pulse, provided that this phase is not modulated by the source, and even if the reference pulse is bright. The proof also applies to the case where the key is encoded in the photon polarization of a weak coherent-state pulse with a known phase, but only if the phases of the four BB84 signal states are judiciously chosen. The achievable key generation rate scales quadratically with the transmission in the channel, just as for BB84 with phase-randomized weak coherent-state signals (when decoy states are not used). For the case where the phase of the reference pulse is strongly modulated by the source, we exhibit an explicit attack that allows the eavesdropper to learn every key bit in a parameter regime where a protocol using phase-randomized signals is provably secure.

quant-ph↗

arXiv2006

Topological entanglement entropy

We formulate a universal characterization of the many-particle quantum entanglement in the ground state of a topologically ordered two-dimensional medium with a mass gap. We consider a disk in the plane, with a smooth boundary of length L, large compared to the correlation length. In the ground state, by tracing out all degrees of freedom in the exterior of the disk, we obtain a marginal density operator ρfor the degrees of freedom in the interior. The von Neumann entropy S(ρ) of this density operator, a measure of the entanglement of the interior and exterior variables, has the form S(ρ)= αL -γ+ ..., where the ellipsis represents terms that vanish in the limit L\to\infty. The coefficient α, arising from short wavelength modes localized near the boundary, is nonuniversal and ultraviolet divergent, but -γis a universal additive constant characterizing a global feature of the entanglement in the ground state. Using topological quantum field theory methods, we derive a formula for γin terms of properties of the superselection sectors of the medium.

hep-th↗

arXiv2005

Fault-tolerant quantum computation with long-range correlated noise

We prove a new version of the quantum accuracy threshold theorem that applies to non-Markovian noise with algebraically decaying spatial correlations. We consider noise in a quantum computer arising from a perturbation that acts collectively on pairs of qubits and on the environment, and we show that an arbitrarily long quantum computation can be executed with high reliability in D spatial dimensions, if the perturbation is sufficiently weak and decays with the distance r between the qubits faster than 1/r^D.

quant-ph↗

arXiv2005

Quantum accuracy threshold for concatenated distance-3 codes

We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \times 10^{-5} for an adversarial independent stochastic noise model, is derived from a computer-assisted combinatorial analysis; it is the best lower bound that has been rigorously proven so far.

quant-ph↗

arXiv2005

Phase randomization improves the security of quantum key distribution

Ideal quantum key distribution (QKD) protocols call for a source that emits single photon signals, but the sources used in typical practical realizations emit weak coherent states instead. A weak coherent state may contain more than one photon, which poses a potential security risk. QKD with weak coherent state signals has nevertheless been proven to be secure, but only under the assumption that the phase of each signal is random (and completely unknown to the adversary). Since this assumption need not be fully justified in practice, it is important to know whether phase randomization is really a requirement for security rather than a convenient technical assumption that makes the security proof easier. Here, we exhibit an explicit attack in which the eavesdropper exploits knowledge of the phase of the signals, and show that this attack allows the eavesdropper to learn every key bit in a parameter regime where a protocol using phase-randomized signals is provably secure. Thus we demonstrate that phase randomization really does enhance the security of QKD using weak coherent states. This result highlights the importance of a careful characterization of the source for proofs of the security of quantum key distribution.

quant-ph↗

arXiv2004

Security of quantum key distribution with imperfect devices

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the source and detector are under the limited control of an adversary. Our proof applies when both the source and the detector have small basis-dependent flaws, as is typical in practical implementations of the protocol. We derive a general lower bound on the asymptotic key generation rate for weakly basis-dependent eavesdropping attacks, and also estimate the rate in some special cases: sources that emit weak coherent states with random phases, detectors with basis-dependent efficiency, and misaligned sources and detectors.

quant-ph↗

arXiv2004

Superselection rules and quantum protocols

We show that superselection rules do not enhance the information-theoretic security of quantum cryptographic protocols. Our analysis employs two quite different methods. The first method uses the concept of a reference system -- in a world subject to a superselection rule, unrestricted operations can be simulated by parties who share access to a reference system with suitable properties. By this method, we prove that if an n-party protocol is secure in a world subject to a superselection rule, then the security is maintained even if the superselection rule is relaxed. However, the proof applies only to a limited class of superselection rules, those in which the superselection sectors are labeled by unitary irreducible representations of a compact symmetry group. The second method uses the concept of the format of a message sent between parties -- by verifying the format, the recipient of a message can check whether the message could have been sent by a party who performed charge-conserving operations. By this method, we prove that protocols subject to general superselection rules (including those pertaining to nonabelian anyons in two dimensions) are no more secure than protocols in the unrestricted world. However, the proof applies only to two-party protocols. Our results show in particular that, if no assumptions are made about the computational power of the cheater, then secure quantum bit commitment and strong quantum coin flipping with arbitrarily small bias are impossible in a world subject to superselection rules.

quant-ph↗