Don Monroe
Abstract
A new proof supports a 25-year-old claim of the unique power of quantum computing.
- Bernstein, E. and Vazirani, E. Quantum Complexity Theory, SIAM J. Comput. 26, 1411 (1997). Google Scholar
Digital Library
- Shor, P.W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal of Computing 26, pp. 1484-1509 (1997). Google ScholarDigital Library
- Raz, R. and Tal, A. Oracle Separation of BQP and PH, Electronic Colloquium on Computational Complexity, Report No. 107 (2018).Google Scholar
Index Terms
- Quantum leap
Recommendations
Quantum correlation swapping
Quantum correlations (QCs), including quantum entanglement and those different, are important quantum resources and have attracted much attention recently. Quantum entanglement swapping as a kernel technique has already been applied to quantum repeaters ...
Can quantum discord increase in a quantum communication task?
Quantum teleportation of an unknown quantum state is one of the few communication tasks which has no classical counterpart. Usually the aim of teleportation is to send an unknown quantum state to a receiver. But is it possible in some way that the ...
Construction of general quantum channel for quantum teleportation
We investigate teleportation and controlled teleportation of an arbitrary $$N$$ -qubit state by using a multipartite entanglement channel. By establishing one-to-one correspondence between an $$N$$ -qubit quantum state and a high-dimension quantum state, we ...
Comments