Oracle Quantum Computing
From MaRDI portal
Publication:4490519
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Characterizing classes of functions computable by quantum parallelism
- Complexity Measures for Public-Key Cryptosystems
- Computational Complexity of Probabilistic Turing Machines
- Experimental quantum cryptography.
- Logical Reversibility of Computation
- Quantum complexity theory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Cited in
(17)- On the simulation of quantum Turing machines.
- Almost-everywhere superiority for quantum polynomial time
- The road to quantum computational supremacy
- Quantum computation with classical light: the Deutsch algorithm
- Quantum computing: beyond the limits of conventional computation†
- The robustness of LWPP and WPP, with an application to graph reconstruction
- Quantum computation and quantum information†
- Quantum computing without entanglement
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Space-bounded quantum complexity
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\)
- Analogies and differences between quantum and stochastic automata
- Time evolution of complexity: a critique of three methods
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- ANALYSIS OF QUANTUM FUNCTIONS
- VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
This page was built for publication: Oracle Quantum Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490519)
