Results 1 
7 of
7
A Fault Tolerant, Area Efficient Architecture for Shor’s Factoring Algorithm
"... We optimize the area and latency of Shor’s factoring while simultaneously improving fault tolerance through: (1) balancing the use of ancilla generators, (2) aggressive optimization of error correction, and (3) tuning the core adder circuits. Our custom CAD flow produces detailed layouts of the phys ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
We optimize the area and latency of Shor’s factoring while simultaneously improving fault tolerance through: (1) balancing the use of ancilla generators, (2) aggressive optimization of error correction, and (3) tuning the core adder circuits. Our custom CAD flow produces detailed layouts of the physical components and utilizes simulation to analyze circuits in terms of area, latency, and success probability. We introduce a metric, called ADCR, which is the probabilistic equivalent of the classic AreaDelay product. Our error correction optimization can reduce ADCR by an order of magnitude or more. Contrary to conventional wisdom, we show that the area of an optimized quantum circuit is not dominated exclusively by error correction. Further, our adder evaluation shows that quantum carrylookahead adders (QCLA) beat ripplecarry adders in ADCR, despite being larger and more complex. We conclude with what we believe is one of most accurate estimates of the area and latency required for 1024bit Shor’s factorization: 7659 mm 2 for the smallest circuit and 6 × 10 8 seconds for the fastest circuit.
Distillation protocols for Fourier states in quantum computing,” p
, 2013
"... Fourier states are multiqubit registers that facilitate phase rotations in faulttolerant quantum computing. We propose distillation protocols for constructing the fundamental, nqubit Fourier state with error O(2−n) at a cost of O(n logn) Toffoli gates and Clifford gates, or any arbitrary Fourier ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Fourier states are multiqubit registers that facilitate phase rotations in faulttolerant quantum computing. We propose distillation protocols for constructing the fundamental, nqubit Fourier state with error O(2−n) at a cost of O(n logn) Toffoli gates and Clifford gates, or any arbitrary Fourier state using O(n2) gates. We analyze these protocols with methods from digital signal processing. These results suggest that phase kickback, which uses Fourier states, could be the current lowestoverhead method for generating arbitrary phase rotations. 1
Logic synthesis for faulttolerant quantum computers. arXiv preprint arXiv:1310.7290
, 2013
"... ar ..."
(Show Context)
State of the Art in Quantum Computer Architectures
, 2011
"... Quantum computer architecture as a field remains in its infancy, but carries much promise for producing machines that vastly exceed current classical capabilities, for certain systems designed to solve certain problems. It must be recognized that large systems are not simply larger versions of smal ..."
Abstract
 Add to MetaCart
(Show Context)
Quantum computer architecture as a field remains in its infancy, but carries much promise for producing machines that vastly exceed current classical capabilities, for certain systems designed to solve certain problems. It must be recognized that large systems are not simply larger versions of small systems. These notes review the fronts on which progress must be made for such systems to be realized: experimental development of quantum computing technologies, and theoretical work in quantum error correction, quantum algorithms, and computer architecture. Key open problems are discussed from both a technical and organizational point of view, and specific recommendations for increasing the vibrancy of the architecture effort are given.
unknown title
"... Resource optimization for faulttolerant quantum computing by ..."
(Show Context)
for the 23qubit Golay code
"... Faulttolerant ancilla preparation and noise threshold lower bounds ..."
(Show Context)