-
1
-
-
38749153780
-
-
S. Aaronson and D. Gottesman. Improved simulation of stabilizer circuits. Technical report, arXiv:quant-ph/0406196 v4, 2004.
-
S. Aaronson and D. Gottesman. Improved simulation of stabilizer circuits. Technical report, arXiv:quant-ph/0406196 v4, 2004.
-
-
-
-
3
-
-
0030706543
-
Fault-tolerant quantum computation with constant error
-
D. Aharonov and M. Ben-Or. Fault-tolerant quantum computation with constant error. In STOC, pages 176-188, 1997.
-
(1997)
STOC
, pp. 176-188
-
-
Aharonov, D.1
Ben-Or, M.2
-
4
-
-
33745663040
-
A limit on nonlocality in any world in which communication complexity is not trivial
-
G. Brassard, H. Buhrman, N. Linden, A. Methot, A. Tapp, and F. Unger. A limit on nonlocality in any world in which communication complexity is not trivial. Phys. Rev. Lett., 96:250401, 2006.
-
(2006)
Phys. Rev. Lett
, vol.96
, pp. 250401
-
-
Brassard, G.1
Buhrman, H.2
Linden, N.3
Methot, A.4
Tapp, A.5
Unger, F.6
-
5
-
-
33344456520
-
Universal quantum computation with ideal Clifford gates and noisy ancillas
-
S. Bravyi and A. Kitaev. Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71, 022316, 2005.
-
(2005)
Phys. Rev. A
, vol.71
, pp. 022316
-
-
Bravyi, S.1
Kitaev, A.2
-
6
-
-
0003760270
-
Good quantum error-correcting codes exist
-
A. R. Calderbank and P. Shor. Good quantum error-correcting codes exist. Phys. Rev. A 52, 2493, 1996.
-
(1996)
Phys. Rev. A
, vol.52
, pp. 2493
-
-
Calderbank, A.R.1
Shor, P.2
-
7
-
-
84961364322
-
Quantum entanglement and the communication complexity of the inner product function
-
R. Cleve, W. van Dam, M. Nielsen, and A. Tapp. Quantum entanglement and the communication complexity of the inner product function. Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications, pages 61-74, 1998.
-
(1998)
Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
, pp. 61-74
-
-
Cleve, R.1
van Dam, W.2
Nielsen, M.3
Tapp, A.4
-
8
-
-
0034497165
-
Fast parallel circuits for the quantum fourier transform
-
R. Cleve and J. Watrous. Fast parallel circuits for the quantum fourier transform. In FOCS, pages 526-536, 2000.
-
(2000)
FOCS
, pp. 526-536
-
-
Cleve, R.1
Watrous, J.2
-
9
-
-
38749095702
-
-
available from
-
K. Fukuda. Software cdd+. available from http://www.ifor.math. ethz.ch/ fukuda.
-
Software cdd
-
-
Fukuda, K.1
-
10
-
-
0033604507
-
Demostrating the viability of universal quantum computation using teleportation and single-qubit operations
-
D. Gottesman and I. Chuang. Demostrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature, 402:390-393, 1999.
-
(1999)
Nature
, vol.402
, pp. 390-393
-
-
Gottesman, D.1
Chuang, I.2
-
11
-
-
0141684701
-
How robust is a quantum gate in the presence of noise?
-
A. Harrow and M. Nielsen. How robust is a quantum gate in the presence of noise? Phys. Rev. A 68, 012308, 2003.
-
(2003)
Phys. Rev. A
, vol.68
, pp. 012308
-
-
Harrow, A.1
Nielsen, M.2
-
12
-
-
14844299396
-
Quantum computing with realistically noisy devices
-
E. Knill. Quantum computing with realistically noisy devices. Nature 434, 39-44, 2005.
-
(2005)
Nature
, vol.434
, pp. 39-44
-
-
Knill, E.1
-
14
-
-
0035452545
-
-
G. Nebe, E. M. Rains, and N. J. A. Sloane. The invariants of the Clifford groups. Designs, Codes and Cryptography, 24(99), 2001. math.CO/0001038.
-
G. Nebe, E. M. Rains, and N. J. A. Sloane. The invariants of the Clifford groups. Designs, Codes and Cryptography, 24(99), 2001. math.CO/0001038.
-
-
-
-
18
-
-
4043181959
-
An upper bound on the threshold quantum decoherence rate
-
A. Razborov. An upper bound on the threshold quantum decoherence rate. Quantum Information and Computation, 4(3):222-228, 2004.
-
(2004)
Quantum Information and Computation
, vol.4
, Issue.3
, pp. 222-228
-
-
Razborov, A.1
-
19
-
-
38749151726
-
-
B. Reichardt. personal communicaton. 2005.
-
B. Reichardt. personal communicaton. 2005.
-
-
-
-
20
-
-
25444448555
-
Quantum universality from magic states distillation applied to ess codes
-
Springer, Netherlands
-
B. Reichardt. Quantum universality from magic states distillation applied to ess codes. In Quantum Information Processing, volume 4, pages 251 - 264. Springer, Netherlands, 2005.
-
(2005)
Quantum Information Processing
, vol.4
, pp. 251-264
-
-
Reichardt, B.1
-
21
-
-
33746738958
-
Scheme for reducing decoherence in quantum memory
-
P. Shor. Scheme for reducing decoherence in quantum memory. Phys. Rev. A 52, 2493, 1995.
-
(1995)
Phys. Rev. A
, vol.52
, pp. 2493
-
-
Shor, P.1
-
23
-
-
38749131030
-
-
R. Solovay. talk at mathematical sciences research institute
-
R. Solovay. talk at mathematical sciences research institute.
-
-
-
-
24
-
-
4043092517
-
Error correcting codes in quantum theory
-
A. Steane. Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793, 1996.
-
(1996)
Phys. Rev. Lett
, vol.77
, pp. 793
-
-
Steane, A.1
-
25
-
-
0002029051
-
Functions with bounded symmetric communication complexity, programs over commutative monoids, and ace
-
M. Szegedy. Functions with bounded symmetric communication complexity, programs over commutative monoids, and ace. Journal of Computer and System Sciences, 47:405-423, 1993.
-
(1993)
Journal of Computer and System Sciences
, vol.47
, pp. 405-423
-
-
Szegedy, M.1
-
26
-
-
38749099623
-
Classical simulatability, entanglement breaking, and quantum computation thresholds. Technical report
-
quant-ph/0408076
-
S. Virmani, S. Huelga, and M. Plenio. Classical simulatability, entanglement breaking, and quantum computation thresholds. Technical report, quant-ph/0408076, 2004.
-
(2004)
-
-
Virmani, S.1
Huelga, S.2
Plenio, M.3
|