Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
From MaRDI portal
Publication:3107790
DOI10.1103/PhysRevLett.98.140501zbMath1228.81022arXivquant-ph/0611186WikidataQ51626641 ScholiaQ51626641MaRDI QIDQ3107790
No author found.
Publication date: 26 December 2011
Published in: Physical Review Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0611186
Related Items (27)
Quantum games under decoherence ⋮ Improving the payoffs of cooperators in three-player cooperative game using weak measurements ⋮ Efficient quantum algorithms of finding the roots of a polynomial function ⋮ Creating very true quantum algorithms for quantum energy based computing ⋮ Bayesian Nash equilibria using extended Werner-like states ⋮ Cluster state entanglement of semiconductor quantum dots based on Faraday rotation ⋮ Deterministic implementations of single-photon multi-qubit Deutsch-Jozsa algorithms with linear optics ⋮ Kochen-Specker theorem as a precondition for quantum computing ⋮ Characterizing the Nash equilibria of a three-player Bayesian quantum game ⋮ Backpropagation training in adaptive quantum networks ⋮ Quantum cryptography based on the Deutsch-Jozsa algorithm ⋮ Three-player conflicting interest games and nonlocality ⋮ Quantum cryptography, quantum communication, and quantum computer in a noisy environment ⋮ A classical probability space exists for the measurement theory based on the truth values ⋮ Necessary and sufficient condition for quantum computing ⋮ Quantum communication based on an algorithm of determining a matrix ⋮ Temporally unstructured quantum computation ⋮ Measurement theory in Deutsch's algorithm based on the truth values ⋮ A GENERATION SCHEME OF THE DISTRIBUTED FOUR-PHOTON CLUSTER-TYPE POLARIZATION-ENTANGLED STATES EXPLOITING THE INTEGRATION OF ENTANGLEMENT GATES AND THE CONTROLLED PHASE GATE ⋮ Can von Neumann's theory meet the Deutsch-Jozsa algorithm? ⋮ Time invariance as an additional constraint on nonlocal realism ⋮ There is no axiomatic system for the quantum theory ⋮ New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm ⋮ Some theoretically organized algorithm for quantum computers ⋮ EFFICIENT SCHEME FOR PREPARING POLARIZATION-ENTANGLED PHOTONIC CLUSTER STATES BASED ON CROSS-KERR NONLINEARITY ⋮ Optomechanically induced transparency in memory environment ⋮ Quantum algorithm for the root-finding problem
Cites Work
- Separability of mixed states: necessary and sufficient conditions.
- Bulk Spin-Resonance Quantum Computation
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Separability Criterion for Density Matrices
This page was built for publication: Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
