-
1
-
-
37649028493
-
Improved simulation of stabilizer circuits
-
S. Aaronson and D. Gottesman. "Improved simulation of stabilizer circuits." Physical Rev. A, 052328, 2004.
-
(2004)
Physical Rev. A
, pp. 052328
-
-
Aaronson, S.1
Gottesman, D.2
-
2
-
-
0001539365
-
On economical construction of the transitive closure of an oriented graph
-
V L. Arlazarov, E. A. Dinic, M. A. Kronrod, and I. A. FaradZev. "On economical construction of the transitive closure of an oriented graph." Soviet Mathematics Doklady, pages 1209-1210, 1970.
-
(1970)
Soviet Mathematics Doklady
, pp. 1209-1210
-
-
Arlazarov, V.L.1
Dinic, E.A.2
Kronrod, A.M.3
FaradZev, I.A.4
-
3
-
-
34748841353
-
Elementary gates for quantum computation
-
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. "Elementary gates for quantum computation." Physical Rev. A, pages 3457-3467, 1995.
-
(1995)
Physical Rev. A
, pp. 3457-3467
-
-
Barenc, A.1
Bennett, C.H.2
Cleve, R.3
Di Vincenzo, D.P.4
Margolus, N.5
Shor, P.6
Sleator, T.7
Smolin, J.8
Weinfurter, H.9
-
4
-
-
4243059985
-
Teleporting an unknown quantum state via dual classical and EPR channels
-
C. H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, and W. Wootters. "Teleporting an unknown quantum state via dual classical and EPR channels." Physical Rev. Letters, pages 1895-1899, 1993.
-
(1993)
Physical Rev. Letters
, pp. 1895-1899
-
-
Bennet, C.H.1
Brassard, G.2
Crepeau, C.3
Jozsa, R.4
Peres, A.5
Wootters, W.6
-
5
-
-
4244023347
-
Communication via one- and two-particle operators on Einstein-Podolsky- Rosen states
-
C. H. Bennett and S. J. Wiesner. "Communication via one- and two-particle operators on Einstein-Podolsky- Rosen states." Physical Rev. Letters, pages 2881-2884, 1992.
-
(1992)
Physical Rev. Letters
, pp. 2881-2884
-
-
Bennet, C.H.1
Wiesner, S.J.2
-
6
-
-
33947245820
-
Quantum algorithms: Applicable algebra and quantum physics
-
Springer
-
T. Beth and M. Rotteler. "Quantum algorithms: Applicable algebra and quantum physics." Quantum Information, pages 96-150. Springer, 2001.
-
(2001)
Quantum Information
, pp. 96-150
-
-
Beth, T.1
Rotteler, M.2
-
7
-
-
0141689114
-
Reducing quantum computations to elementary unitary operations
-
G. Cybenko. "Reducing quantum computations to elementary unitary operations." Comp. in Sci. and Engin., pages 27-32, March/April 2001. (Pubitemid 33739786)
-
(2001)
Computing in Science and Engineering
, vol.3
, Issue.2
, pp. 27-32
-
-
Cybenko, G.1
-
8
-
-
33751021446
-
Two-bit gates are universal for quantum computation
-
D. P. DiVincenzo. "Two-bit gates are universal for quantum computation." Physical Rev. A, pages 1015-1022, 1995.
-
(1995)
Physical Rev. A
, pp. 1015-1022
-
-
Di Vincenzo, D.P.1
-
9
-
-
0043136670
-
A transformation based algorithm for reversible logic synthesis
-
D. M. Miller, D. Maslov, and G. W. Dueck, "A transformation based algorithm for reversible logic synthesis." Design Automation Conf., pages 318-323, 2003.
-
(2003)
Design Automation Conf.
, pp. 318-323
-
-
Mille, D.M.1
Maslov, D.2
Dueck, W.G.3
-
11
-
-
0013031351
-
A general decomposition for reversible logic
-
August
-
M. Perkowski et al., "A general decomposition for reversible logic." Reed-Muller Workshop, August 2001.
-
(2001)
Reed-Muller Workshop
-
-
Perkowski, M.1
-
13
-
-
0038718548
-
Synthesis of reversible logic circuits
-
June
-
V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes. "Synthesis of reversible logic circuits." IEEE Trans. on CAD, pages 710-722, June 2003.
-
(2003)
IEEE Trans. on CAD
, pp. 710-722
-
-
Shend, V.V.1
Prasad, A.K.2
Markov, L.I.3
Hayes, J.P.4
|