Dorit Aharonov
Noam Nisan
- 1.D. Aharonov and M. Ben-Or. Fault tolerant computa. tion with constant error, quant-ph/9611025. In STOC 97, 1996. Google Scholar
Digital Library
- 2.C. Bennet, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. In SIAM J, computing, vol. 26, No 5, pp.1510-1523, oc. tober 1997. Google ScholarDigital Library
- 3.E. Bernstein and U. Vazirani. Quantum comple.,dty theory. In SIAM J, computing, vol. 26, No 5, pp.1411- id 73, october 1997. Google ScholarDigital Library
- 4.D. Deutsch. Quantum theory, the church-turlng prin. ciple and the universal quantum computer. In Proc. Roy. Soc. Lond, Vol. A400, 1935.Google Scholar
- 5.R. Feymnan. Simulating physics with computers. In International Journal of Theoretical Physics, Vol. 21, No. 6/7, pages 467-488, 1982.Google Scholar
- 6.L. Grover. Quantum mechanics helps in searching for a needle in a haystack, quant-ph}9605043, phys. rev. lett. 79, 325-328.Google Scholar
- 7.I<. HeUwig and K. i<raus. Communications in mathcmatical physics, 16 142 (1970) , m.d. chi, linear algebra and its app~cations 10 286 (1975), k. kraus, states, effects and operations: Foundamental notions of quantum theory(springer-verlag, berlin, 1983), b. sdmreacher, sending entanglement through noisy quantum channels quant-ph/9604023, volume 16, 142 (1970).Google Scholar
- 8.J.J.Saqurai. Modern Quantum Mechanics, rcviocd cdi. tion. Addison Wesley, 1994.Google Scholar
- 9.A. Kitaev. Quantum error correction with imperfect gates, manuscript, 1997.Google Scholar
- 10.E. KniU, R. Lafiamme, and W.H. Zurek. Resillant quantum computation. Science, 279, pp 342, 1998.Google ScholarCross Ref
- 11.P. W. Shor. Fault-tolerant quantum computation. In Proceedings of the 37th Symposium on the Foundationo of Computer Science, pages 56-65, Los Alamitos, Cal. ifornia, 1996, IEEE press., 1996. Google ScholarDigital Library
- 12.P.W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In SIAM J, computing, vol. 26, No 5, pp. idSJ-1509, october, 1997. Google ScholarDigital Library
- 13.D. Simon. On the power of quantum computation. in SIAM J, computing, vol. '26, No 5, pp.147~-I483, october 199Z Google ScholarDigital Library
- 14.A. Yao. Quantum circuit complexity. In 8$th An. nual Symposium on Foundations of Computer Scicnec, pages 352-361, 1993.Google Scholar
Index Terms
- Quantum circuits with mixed states
Recommendations
Quantum correlation swapping in parallel and antiparallel two-qubit mixed states
Quantum correlations (QCs) in some mixed states are thought as important resources in performing certain quantum communication tasks. Recently, it is found that (Azam et al. in Phys Rev A 91:012304, 2015) separable two-qubit states with maximally mixed ...
Mixed maximally entangled states
We find that the mixed maximally entangled states exist and prove that the form of the mixed maximally entangled states is unique in terms of the entanglement of formation. Moreover, even if the entanglement is quantified by other entanglement measures, ...
Distinguishability of quantum states by separable operations
In this paper, we study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An ...
Comments