Quantum computing without entanglement
From MaRDI portal
Publication:596121
DOI10.1016/j.tcs.2004.03.041zbMath1067.81009arXivquant-ph/0306182OpenAlexW2032897227WikidataQ56428625 ScholiaQ56428625MaRDI QIDQ596121
Gilles Brassard, Eli Biham, Dan Kenigsberg, Tal Mor
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0306182
Related Items (23)
Atom-photon entanglement beyond the multi-photon resonance condition ⋮ Semiquantum key distribution ⋮ Quantum correlations of identical particles subject to classical environmental noise ⋮ On the Brodutch and Modi method of constructing geometric measures of classical and quantum correlations ⋮ Quantum computation with classical light: the Deutsch algorithm ⋮ Using nonlocal coherence to quantify quantum correlation ⋮ Quantum discord versus second-order MQ NMR coherence intensity in dimers ⋮ Measurement-induced geometric measures of correlations based on the trace distance for two-qubit \(X\) states ⋮ Tripartite quantum discord dynamics in qubits driven by the joint influence of distinct classical noises ⋮ Quantum encoding of dynamic directed graphs ⋮ The elusive source of quantum speedup ⋮ Total correlations and mutual information ⋮ QUANTUM DISCORD FOR MULTIPARTITE COHERENT STATES INTERPOLATING BETWEEN WERNER AND GREENBERGER–HORNE–ZEILINGER STATES ⋮ Dynamics of tripartite quantum correlations and decoherence in flux qubit systems under local and non-local static noise ⋮ The Deutsch-Jozsa problem: de-quantisation and entanglement ⋮ On quantum no-broadcasting ⋮ Quantum correlation evolution of GHZ and \(W\) states under noisy channels using ameliorated measurement-induced disturbance ⋮ Quantum entanglement ⋮ Quantum Key Distribution with Classical Bob ⋮ Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations ⋮ Directed graph encoding in quantum computing supporting edge-failures ⋮ Quantum absentminded driver problem revisited ⋮ Measurement-induced geometric measures of correlations based on the Hellinger distance and their local decoherence
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum communication complexity
- Quantum computational networks
- Bulk Spin-Resonance Quantum Computation
- Computing with highly mixed states (extended abstract)
- Quantum algorithms: entanglement–enhanced information processing
- New directions in cryptography
- Rapid solution of problems by quantum computation
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Oracle Quantum Computing
- Maximal violation of Bell inequalities for mixed states
- On the role of entanglement in quantum-computational speed-up
- Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
This page was built for publication: Quantum computing without entanglement
