2,402 research outputs found
Quantum computing and the entanglement frontier - Rapporteur talk at the 25th Solvay Conference
Quantum information science explores the frontier of highly complex quantum states,
the "entanglement frontier". This study is motivated by the observation (widely believed
but unproven) that classical systems cannot simulate highly entangled quantum systems
efficiently, and we hope to hasten the day when well controlled quantum systems can
perform tasks surpassing what can be done in the classical world. One way to achieve
such "quantum supremacy" would be to run an algorithm on a quantum computer which
solves a problem with a super-polynomial speedup relative to classical computers, but
there may be other ways that can be achieved sooner, such as simulating exotic quantum
states of strongly correlated matter. To operate a large scale quantum computer reliably
we will need to overcome the debilitating effects of decoherence, which might be done
using "standard" quantum hardware protected by quantum error-correcting codes, or by
exploiting the nonabelian quantum statistics of anyons realized in solid state systems,
or by combining both methods. Only by challenging the entanglement frontier will we
learn whether Nature provides extravagant resources far beyond what the classical world
would allow
Fault tolerance for holonomic quantum computation
We review an approach to fault-tolerant holonomic quantum computation on
stabilizer codes. We explain its workings as based on adiabatic dragging of the
subsystem containing the logical information around suitable loops along which
the information remains protected.Comment: 16 pages, this is a chapter in the book "Quantum Error Correction",
edited by Daniel A. Lidar and Todd A. Brun, (Cambridge University Press,
2013), at
http://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/quantum-error-correctio
Towards a realistic GaAs-spin qubit device for a classical error-corrected quantum memory
Based on numerically-optimized real-device gates and parameters we study the
performance of the phase-flip (repetition) code on a linear array of Gallium
Arsenide (GaAs) quantum dots hosting singlet-triplet qubits. We first examine
the expected performance of the code using simple error models of circuit-level
and phenomenological noise, reporting, for example, a circuit-level
depolarizing noise threshold of approximately 3%. We then perform
density-matrix simulations using a maximum-likelihood and minimum-weight
matching decoder to study the effect of real-device dephasing, read-out error,
quasi-static as well as fast gate noise. Considering the trade-off between
qubit read-out error and dephasing time (T2) over measurement time, we identify
a sub-threshold region for the phase-flip code which lies within experimental
reach.Comment: 22 page
Quantum Computing: Pro and Con
I assess the potential of quantum computation. Broad and important
applications must be found to justify construction of a quantum computer; I
review some of the known quantum algorithms and consider the prospects for
finding new ones. Quantum computers are notoriously susceptible to making
errors; I discuss recently developed fault-tolerant procedures that enable a
quantum computer with noisy gates to perform reliably. Quantum computing
hardware is still in its infancy; I comment on the specifications that should
be met by future hardware. Over the past few years, work on quantum computation
has erected a new classification of computational complexity, has generated
profound insights into the nature of decoherence, and has stimulated the
formulation of new techniques in high-precision experimental physics. A broad
interdisciplinary effort will be needed if quantum computers are to fulfill
their destiny as the world's fastest computing devices. (This paper is an
expanded version of remarks that were prepared for a panel discussion at the
ITP Conference on Quantum Coherence and Decoherence, 17 December 1996.)Comment: 17 pages, LaTeX, submitted to Proc. Roy. Soc. Lond. A, minor
correction
- …