Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Self-testing of universal and fault-tolerant sets of quantum gates
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Topological Quantum Computation
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Physical Implementations for Quantum Communication in Quantum Networks
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Fault-Tolerant Quantum Computation with Higher-Dimensional Systems
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The effect of communication costs in solid-state quantum computing architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
On the simulation of quantum Turing machines
Theoretical Computer Science
Quantum entanglement as a new information processing resource
New Generation Computing - Quantum computing
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
A lower bound on the quantum query complexity of read-once functions
Journal of Computer and System Sciences
Architectural implications of quantum computing technologies
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Distributed Arithmetic on a Quantum Multicomputer
Proceedings of the 33rd annual international symposium on Computer Architecture
Uniformity of quantum circuit families for error-free algorithms
Theoretical Computer Science
Quantum Error Correction of Time-correlated Errors
Quantum Information Processing
Communication Links for Distributed Quantum Computation
IEEE Transactions on Computers
Arithmetic on a distributed-memory quantum multicomputer
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Abstract error groups via Jones unitary braid group representations at q = i
Quantum Information Processing
Quantum Information Processing
Recent progress in quantum algorithms
Communications of the ACM
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Algorithms on ensemble quantum computers
Natural Computing: an international journal
Volume thresholds for quantum fault tolerance
Quantum Information Processing
Nonlocal quantum information in bipartite quantum error correction
Quantum Information Processing
Secure two-party quantum evaluation of unitaries against specious adversaries
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Fault Models for Quantum Mechanical Switching Networks
Journal of Electronic Testing: Theory and Applications
Roots and stimuli to a new perception of informatics
Rainbow of computer science
Upper bounds on the noise threshold for fault-tolerant quantum computing
Quantum Information & Computation
Characterization of universal two-qubit hamiltonian
Quantum Information & Computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Quantum computer architecture for fast entropy extraction
Quantum Information & Computation
An upper bound on the threshold quantum decoherence rate
Quantum Information & Computation
Quantum accuracy threshold for concatenated distance-3 codes
Quantum Information & Computation
Robustness of Shor's algorithm
Quantum Information & Computation
Fault-tolerant quantum computation for local leakage faults
Quantum Information & Computation
How to build a 300 bit, 1 Giga-operation quantum computer
Quantum Information & Computation
Unambiguous unitary quantum channels
Quantum Information & Computation
Accuracy threshold for postselected quantum computation
Quantum Information & Computation
Universal fault tolerant quantum computation on bilinear nearest neighbor arrays
Quantum Information & Computation
Encoded universality from a single physical interaction
Quantum Information & Computation
Universal sets of quantum information processing primitives and their optimal use
General Theory of Information Transfer and Combinatorics
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Finite Fields and Their Applications
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
A class of quantum low-density parity check codes by combining seed graphs
Quantum Information Processing
Fault-tolerant ancilla preparation and noise threshold lower boudds for the 23-qubit Golay code
Quantum Information & Computation
Sufficient condition on noise correlations for scalable quantum computing
Quantum Information & Computation
The robustness of magic state distillation against errors in Clifford gates
Quantum Information & Computation
Quantum Information & Computation
| Hi-index | 0.02 |
It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1/logc t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1/t). We do this by showing that operations can be performed on quantum data encoded by quantum error-correcting codes without decoding this data.