Necessary and sufficient condition for quantum computing
From MaRDI portal
Recommendations
- Necessary and Sufficient Conditions for Quantum Computation
- Requirements for a quantum computer
- Kochen-Specker theorem as a precondition for quantum computing
- Necessary and sufficient condition for nonzero quantum discord
- Quantum Computability
- Necessary and sufficient conditions on measurements of quantum channels
- Universal quantum-copying machines: A sufficient and necessary condition
- Quantum nonderterministic computation
- scientific article; zbMATH DE number 1555956
- Quantum computation and NP-complete problems
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Creating very true quantum algorithms for quantum energy based computing
- Efficient quantum algorithm for the parity problem of a certain function
- Efficient quantum algorithms of finding the roots of a polynomial function
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Quantum Complexity Theory
- Quantum algorithm for the root-finding problem
- Quantum algorithms revisited
- Quantum complexity theory
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Rapid solution of problems by quantum computation
Cited in
(2)
This page was built for publication: Necessary and sufficient condition for quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740946)
