49 research outputs found
Improved magic states distillation for quantum universality
Given stabilizer operations and the ability to repeatedly prepare a
single-qubit mixed state rho, can we do universal quantum computation? As
motivation for this question, "magic state" distillation procedures can reduce
the general fault-tolerance problem to that of performing fault-tolerant
stabilizer circuits.
We improve the procedures of Bravyi and Kitaev in the Hadamard "magic"
direction of the Bloch sphere to achieve a sharp threshold between those rho
allowing universal quantum computation, and those for which any calculation can
be efficiently classically simulated. As a corollary, the ability to repeatedly
prepare any pure state which is not a stabilizer state (e.g., any single-qubit
pure state which is not a Pauli eigenstate), together with stabilizer
operations, gives quantum universality. It remains open whether there is also a
tight separation in the so-called T direction.Comment: 6 pages, 5 figure
Nonlocality as a Benchmark for Universal Quantum Computation in Ising Anyon Topological Quantum Computers
An obstacle affecting any proposal for a topological quantum computer based
on Ising anyons is that quasiparticle braiding can only implement a finite
(non-universal) set of quantum operations. The computational power of this
restricted set of operations (often called stabilizer operations) has been
studied in quantum information theory, and it is known that no
quantum-computational advantage can be obtained without the help of an
additional non-stabilizer operation. Similarly, a bipartite two-qubit system
based on Ising anyons cannot exhibit non-locality (in the sense of violating a
Bell inequality) when only topologically protected stabilizer operations are
performed. To produce correlations that cannot be described by a local hidden
variable model again requires the use of a non-stabilizer operation. Using
geometric techniques, we relate the sets of operations that enable universal
quantum computing (UQC) with those that enable violation of a Bell inequality.
Motivated by the fact that non-stabilizer operations are expected to be highly
imperfect, our aim is to provide a benchmark for identifying UQC-enabling
operations that is both experimentally practical and conceptually simple. We
show that any (noisy) single-qubit non-stabilizer operation that, together with
perfect stabilizer operations, enables violation of the simplest two-qubit Bell
inequality can also be used to enable UQC. This benchmarking requires finding
the expectation values of two distinct Pauli measurements on each qubit of a
bipartite system.Comment: 12 pages, 2 figure
Qudit versions of the qubit "pi-over-eight" gate
When visualised as an operation on the Bloch sphere, the qubit
"pi-over-eight" gate corresponds to one-eighth of a complete rotation about the
vertical axis. This simple gate often plays an important role in quantum
information theory, typically in situations for which Pauli and Clifford gates
are insufficient. Most notably, when it supplements the set of Clifford gates
then universal quantum computation can be achieved. The "pi-over-eight" gate is
the simplest example of an operation from the third level of the Clifford
hierarchy (i.e., it maps Pauli operations to Clifford operations under
conjugation). Here we derive explicit expressions for all qudit (d-level, where
d is prime) versions of this gate and analyze the resulting group structure
that is generated by these diagonal gates. This group structure differs
depending on whether the dimensionality of the qudit is two, three or greater
than three. We then discuss the geometrical relationship of these gates (and
associated states) with respect to Clifford gates and stabilizer states. We
present evidence that these gates are maximally robust to depolarizing and
phase damping noise, in complete analogy with the qubit case. Motivated by this
and other similarities we conjecture that these gates could be useful for the
task of qudit magic-state distillation and, by extension, fault-tolerant
quantum computing. Very recent, independent work by Campbell, Anwar and Browne
confirms the correctness of this intuition, and we build upon their work to
characterize noise regimes for which noisy implementations of these gates can
(or provably cannot) supplement Clifford gates to enable universal quantum
computation.Comment: Version 2 changed to reflect improved distillation routines in
arXiv:1205.3104v2. Minor typos fixed. 12 Pages,2 Figures,3 Table
Algorithms on ensemble quantum computers.
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement
Generalized Boolean Functions and Quantum Circuits on IBM-Q
We explicitly derive a connection between quantum circuits utilising IBM's
quantum gate set and multivariate quadratic polynomials over integers modulo 8.
We demonstrate that the action of a quantum circuit over input qubits can be
written as generalized Walsh-Hadamard transform. Here, we derive the
polynomials corresponding to implementations of the Swap gate and Toffoli gate
using IBM-Q gate set.Comment: 7 pages, 8 figures, Accepted to Publish in: 10th International
Conference on Computing, Communication and Networking Technologies and IEEE
Xplor