Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm …
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum …
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of …
D Aharonov, M Ben-Or - Proceedings of the twenty-ninth annual ACM …, 1997 - dl.acm.org
In the past year many developments have taken place in the area of quantum error corrections. Recently Shor showed how to perform fault tolerant quantum computation …
In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this …
S Bravyi, J Haah - Physical Review A—Atomic, Molecular, and Optical …, 2012 - APS
We propose a family of error-detecting stabilizer codes with an encoding rate of 1/3 that permit a transversal implementation of the gate T= exp (− i π Z/8) on all logical qubits. These …
DE Liu, HU Baranger - Physical Review B—Condensed Matter and Materials …, 2011 - APS
We propose an experimental setup for detecting a Majorana zero mode consisting of a spinless quantum dot coupled to the end of ap-wave superconducting nanowire. The …
Y Shi - arXiv preprint quant-ph/0205115, 2002 - arxiv.org
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate …
AM Childs - arXiv preprint quant-ph/0111046, 2001 - arxiv.org
Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum …