5,014 research outputs found
Simulating chemistry efficiently on fault-tolerant quantum computers
Quantum computers can in principle simulate quantum physics exponentially
faster than their classical counterparts, but some technical hurdles remain.
Here we consider methods to make proposed chemical simulation algorithms
computationally fast on fault-tolerant quantum computers in the circuit model.
Fault tolerance constrains the choice of available gates, so that arbitrary
gates required for a simulation algorithm must be constructed from sequences of
fundamental operations. We examine techniques for constructing arbitrary gates
which perform substantially faster than circuits based on the conventional
Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf.
Comput.}, \textbf{6}:81, 2006]. For a given approximation error ,
arbitrary single-qubit gates can be produced fault-tolerantly and using a
limited set of gates in time which is or ; with sufficient parallel preparation of ancillas, constant average
depth is possible using a method we call programmable ancilla rotations.
Moreover, we construct and analyze efficient implementations of first- and
second-quantized simulation algorithms using the fault-tolerant arbitrary gates
and other techniques, such as implementing various subroutines in constant
time. A specific example we analyze is the ground-state energy calculation for
Lithium hydride.Comment: 33 pages, 18 figure
Synthesis of Topological Quantum Circuits
Topological quantum computing has recently proven itself to be a very
powerful model when considering large- scale, fully error corrected quantum
architectures. In addition to its robust nature under hardware errors, it is a
software driven method of error corrected computation, with the hardware
responsible for only creating a generic quantum resource (the topological
lattice). Computation in this scheme is achieved by the geometric manipulation
of holes (defects) within the lattice. Interactions between logical qubits
(quantum gate operations) are implemented by using particular arrangements of
the defects, such as braids and junctions. We demonstrate that junction-based
topological quantum gates allow highly regular and structured implementation of
large CNOT (controlled-not) gate networks, which ultimately form the basis of
the error corrected primitives that must be used for an error corrected
algorithm. We present a number of heuristics to optimise the area of the
resulting structures and therefore the number of the required hardware
resources.Comment: 7 Pages, 10 Figures, 1 Tabl
Negative Quasi-Probability as a Resource for Quantum Computation
A central problem in quantum information is to determine the minimal physical
resources that are required for quantum computational speedup and, in
particular, for fault-tolerant quantum computation. We establish a remarkable
connection between the potential for quantum speed-up and the onset of negative
values in a distinguished quasi-probability representation, a discrete analog
of the Wigner function for quantum systems of odd dimension. This connection
allows us to resolve an open question on the existence of bound states for
magic-state distillation: we prove that there exist mixed states outside the
convex hull of stabilizer states that cannot be distilled to non-stabilizer
target states using stabilizer operations. We also provide an efficient
simulation protocol for Clifford circuits that extends to a large class of
mixed states, including bound universal states.Comment: 15 pages v4: This is a major revision. In particular, we have added a
new section detailing an explicit extension of the Gottesman-Knill simulation
protocol to deal with positively represented states and measurement (even
when these are non-stabilizer). This paper also includes significant
elaboration on the two main results of the previous versio
A Study on the Noise Threshold of Fault-tolerant Quantum Error Correction
Quantum circuits implementing fault-tolerant quantum error correction (QEC)
for the three qubit bit-flip code and five-qubit code are studied. To describe
the effect of noise, we apply a model based on a generalized effective
Hamiltonian where the system-environment interactions are taken into account by
including stochastic fluctuating terms in the system Hamiltonian. This noise
model enables us to investigate the effect of noise in quantum circuits under
realistic device conditions and avoid strong assumptions such as maximal
parallelism and weak storage errors. Noise thresholds of the QEC codes are
calculated. In addition, the effects of imprecision in projective measurements,
collective bath, fault-tolerant repetition protocols, and level of parallelism
in circuit constructions on the threshold values are also studied with emphasis
on determining the optimal design for the fault-tolerant QEC circuit. These
results provide insights into the fault-tolerant QEC process as well as useful
information for designing the optimal fault-tolerant QEC circuit for particular
physical implementation of quantum computer.Comment: 9 pages, 9 figures; to be submitted to Phys. Rev.
Error suppression via complementary gauge choices in Reed-Muller codes
Concatenation of two quantum error correcting codes with complementary sets
of transversal gates can provide a means towards universal fault-tolerant
computation. We first show that it is generally preferable to choose the inner
code with the higher pseudo-threshold in order to achieve lower logical failure
rates. We then explore the threshold properties of a wide range of
concatenation schemes. Notably, we demonstrate that the concatenation of
complementary sets of Reed-Muller codes can increase the code capacity
threshold under depolarizing noise when compared to extensions of previously
proposed concatenation models. We also analyze the properties of logical errors
under circuit level noise, showing that smaller codes perform better for all
sampled physical error rates. Our work provides new insights into the
performance of universal concatenated quantum codes for both code capacity and
circuit level noise.Comment: 11 pages + 4 appendices, 6 figures. In v2, Fig.1 was added to conform
to journal specification
- …