Virtual Numbers to Represent Entangled Quantum States

Lalit A. Patel^{*}

Show more

References

[1] Deutsch, D. (1985) Quantum Theory: The Church-Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London, A400, 97-117. http://rspa.royalsocietypublishing.org/content/400/1818/97.abstract

[2] Shor, P.W. (1994) Algorithms for Quantum Computation: Discrete Log and Factoring. Foundations of Computer Science, 1994, 124-134. http://www.computer.org/csdl/proceedings/focs/1994/6580/00/0365700-abs.html

[3] Grover, L.K. (1997) Quantum Computers Can Search Arbitrarily Large Databases by a Single Query. Physical Review Letters, 79, 4709-4712. http://dx.doi.org/10.1103/PhysRevLett.79.4709

[4] Nielsen, M.A. and Chuang, I.L. (2011) Quantum Computation and Quantum Information. University Press, Cambridge.

[5] Bell, J.S. (1964) On the Einstein-Podolsky-Rosen Paradox. Physics, 1, 195-200.

[6] Beil, C. (2013) Quantum Entanglement, Emergence, and Noncommutative Blowups.

http://arxiv-web3.library.cornell.edu/pdf/1310.5673v1.pdf

[7] Auletta, G. (2013) A New Way to Implement Quantum Computation. Journal of Quantum Information Science, 3, 127-137. http://dx.doi.org/10.4236/jqis.2013.34017