The following pages link to Oracle Quantum Computing (Q4490519):
Displaying 17 items.
- Quantum computing without entanglement (Q596121) (← links)
- Quantum computation with classical light: the Deutsch algorithm (Q888098) (← links)
- On the simulation of quantum Turing machines. (Q1401393) (← links)
- Computational complexity of uniform quantum circuit families and quantum Turing machines (Q1605308) (← links)
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\) (Q1607126) (← links)
- The Deutsch-Jozsa problem: de-quantisation and entanglement (Q1761700) (← links)
- Almost-everywhere superiority for quantum polynomial time (Q1854537) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204) (← links)
- Time evolution of complexity: a critique of three methods (Q2421658) (← links)
- The Road to Quantum Computational Supremacy (Q3298037) (← links)
- Quantum computation and quantum information† (Q3375535) (← links)
- Quantum computing: beyond the limits of conventional computation† (Q3426225) (← links)
- VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM (Q3509799) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)
- Analogies and differences between quantum and stochastic automata (Q5958112) (← links)