Efficient quantum computing operations

Details Efficient quantum computing operations Efficient quantum computing operations

2006-09-26

2006-09-26

Chaki, Kakali (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

C257S014000

Reexamination Certificate

active

07113967

ABSTRACT:
A method of performing a quantum Fourier transform in a quantum computing circuit is disclosed. The method includes forming a quantum computing circuit as a collection of two-qubit gates operating on a sequence of input qubits. Auxiliary qubits are then interacted with the original input qubits to place the auxiliary qubits in a state corresponding to an output of a discrete Fourier transform of a classical state of the input qubits. The original input qubits are then re-set to their ground state by physically interacting the input qubits with the auxiliary qubits. The auxiliary qubits are then transformed to a state representative of a quantum Fourier transform of the sequence of input qubits.

REFERENCES:
patent: 4419579 (1983-12-01), East
patent: 4476384 (1984-10-01), Westphal
patent: 4648133 (1987-03-01), Vilnrotter
patent: 4833633 (1989-05-01), Morris
patent: 4843328 (1989-06-01), Greenhall
patent: 5243649 (1993-09-01), Franson
patent: 5307410 (1994-04-01), Bennett
patent: 5339182 (1994-08-01), Kimble et al.
patent: 5418905 (1995-05-01), Rarity et al.
patent: 5515438 (1996-05-01), Bennett et al.
patent: 5568301 (1996-10-01), Tiemann et al.
patent: 5570222 (1996-10-01), Chovan
patent: 5675648 (1997-10-01), Townsend
patent: 5732139 (1998-03-01), Lo et al.
patent: 5757912 (1998-05-01), Blow
patent: 5764765 (1998-06-01), Phoenix et al.
patent: 5768297 (1998-06-01), Shor
patent: 5768378 (1998-06-01), Townsend et al.
patent: 5850441 (1998-12-01), Townsend et al.
patent: 5953421 (1999-09-01), Townsend
patent: 5987483 (1999-11-01), Edelkind et al.
patent: 5999285 (1999-12-01), Brandt et al.
patent: 6076097 (2000-06-01), London et al.
patent: 6128764 (2000-10-01), Gottesman
patent: 6188768 (2001-02-01), Bethune et al.
patent: 6218657 (2001-04-01), Bethune et al.
patent: 6272224 (2001-08-01), Mazourenko et al.
patent: 6289104 (2001-09-01), Patterson et al.
patent: 6301029 (2001-10-01), Azuma
patent: 6314189 (2001-11-01), Motoyoshi et al.
patent: 6360183 (2002-03-01), Shilton
patent: 6393448 (2002-05-01), Dultz et al.
patent: 6438234 (2002-08-01), Gisin et al.
patent: 2001/0055389 (2001-12-01), Hughes et al.
patent: 2002/0025041 (2002-02-01), Tomita
patent: WO 96/06491 (1996-02-01), None
patent: WO 97/44936 (1997-11-01), None
patent: WO 98/10560 (1998-03-01), None
Cleve et al., Fast Parallel circuits for the quantum Fourier Transform, 2000, IEEE, pp. 526-536.
John Watrous, Quantum simulations of classical random walks and undirected graph connectivity, 1999, IEEE, pp. 180-187.
John Watrous, Relationships between quantum and classical space-bounded complexity classes, 1998, IEEE, pp. 210-227.
Nader et al., Size-Depth tradeoffs for algebraic formulae, 1991, IEEE, pp. 334-341.
U.S. Appl. No. 60/025,839, filed Sep. 5, 1996, Gisin et al.
Townsend, “Quantum cryptography on official fiber networks,” Optical Fiber Technology (1998).
Gottesman et al., “From Quantum Cheating to Quantum Security,” Physics Today Online, Nov. 2000, www.physicstoday.org/pt/vol-53/iss-11/p22.html pp. 1-11.
Stucki et al., “Quantum Key Distribution over 67 km with a Plug&Play System,” Mar. 22, 2002, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0203/0203118.pdf pp. 1-7.
Buttler et al., “New, Efficient and Robust, Fiber-based Quantum Key Distribution Key Disribution Schemes,” Mar. 20, 2002, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0203/0203098.pdf pp. 1-4.
Gisin et al., “Quantum Cryptography,” Sep. 18, 2001, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0101/0101098.pdf pp. 1-57.
Kempe et al., “Theory of Decoherance-Free Fault-tolerant Universal Quantum Computation,” Apr. 19, 2000, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0004/0004064.pdf pp. 1-40.
Bennett et al., “Experimental Quantum Cryptography,” J. Cryptology, vol. 5, pp. 3-28, 1992.
Brassard et al., “Secret Key Reconciliation by Public Discussion, Advances in Cryptology,” Eurocrypt' 93 Proceedings, pp. 410-423, 1993.
Sugimoto et al., “A study on Secret Key Reconciliation Protocol Cascade,” IEICE Trans. Fundamentals E83-A, pp. 1987-1991, Jan. 2000.
Bennett et al., “Generalized Privacy Amplification,” IEEE Trans. on Information Theory, vol. 41, No. 6, pp. 1915-1923, Nov. 1995.
Maurer, “Secret Key Agreement by Public Discussion from Common Information,” IEEE Trans. Inf. Theory vol. 39, No. 3, 733-742, May 1993.
Maurer et al., “Unconditionally Secure Key Agreement and the Intrinsic Conditional Information,” IEEE Trans. Inf. Theory vol. 45, No. 2, 499-514, Mar. 1999.
Shor et al., “Simple proof of security of the BB84 quantum key distribution protocol,” Phys. Rev. Lett. vol. 85, No. 2, pp. 441-444, Jul. 2000.
Mayers, “Unconditional security in quantum cryptography,” Journal of the ACM, vol. 48, No. 3, pp. 351-406, May 2001.
Bennett et al., “Quantum cryptography: Public key distribution and coin tossing,” Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, IEEE, pp. 175-179, Dec. 1984.
Ekert, “Quantum cryptography based on Bell's Theorem,” Phys. Rev. Lett. vol. 67, pp. 661-663, Aug. 1991.
Bennett et al., “Mixed-state entanglement and quantum error correction,” Phys. Rev. A, vol. 54, No. 5, pp. 3824-3851, Nov. 1996.
Bennett et al., “Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels,” Phys. Rev. Lett., vol. 76, No. 5, pp. 722-725, Jan. 1991.
Deutsch et al., “Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels,” Phys. Rev. Lett. 77, 2818-2821, Sep. 1996; 80, No. 9, 2022, Mar. 1998 errata.
Mayers, preprint of, “Unconditional Security in Quantum Cryptography,” Sep. 15, 1998, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/9802/9802025.pdf pp. 1-18.
Lo et al., “Unconditional security of quantum key distribution over arbitrarily long distances,” Science, vol. 283, (1999), pp. 2050-2056; also available at http://xxx.lanl.gov/PS—cache/quant-ph/pdf/9803/9803006.pdf pp. 1-21.
Biham et al., “A proof of security of quantum key distribution,” Dec. 11, 1999, http://aps.arxiv.org/PS—cache/quant-ph/pdf/9912/9912053.pdf 31 pages.
Inamori et al., “Unconditional Security of Practical Quantum Key Distribution,” Jul. 3, 2001 http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0107/0107017.pdf pp. 1-47.
Gottesman et al., “Proof of security of quantum key distribution with two-way classical communications,” May 23, 2001, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0105/0105121.pdf pp. 1-17.
Lo, “Proof of unconditional security of six-state quantum key distribution scheme,” Quantum Information and Computation, vol. 1, No. 2, pp. 81-94, 2001.
Bennett et al., “Generalized Privacy Amplification,” IEEE Transactions on Information Theory, vol. 41, No. 6, pp. 1915-1923, Nov. 1995).
Bruss, “Optimal eavesdropping in quantum cryptography with six states,” Phys. Rev. Lett., vol. 81, No. 14, pp. 3018-3021, Oct. 1998.
Lo et al., “Efficient quantum key distribution scheme and proof of its unconditional security,” Nov. 30, 2001, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0011/0011056.pdf pp. 1-32.
Gottesman et al., “Secure quantum key distribution using squeezed states,” Sep. 25, 2000, http://xxx.lanl.gov/PS—cache/quant-ph/pdf/0008/0008046.pdf pp. 1-19.
Calderbank et al., “Good Quantum error-correcting codes exist,” Apr. 16, 1996, http://aps.arxiv.org/PS—cache/quant-ph/pdf/9512/9512032.pdf pp. 1-24.
Steane, “Multiple particle interference and quantum error correction,” May 13, 1996, http://aps.arxiv.org/PS—cache/quant-ph/pdf/9601/9601029.pdf pp. 1-45.
Fuchs et al., “Optimal eavesdropping in quantum crytography. I,” Jan. 30, 1997, http://aps.arxiv.org/PS—cache/quant-ph/pdf/97010/97010

Affiliated with

Also associated with

Rating

Efficient quantum computing operations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient quantum computing operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum computing operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3597815