ANALYSIS OF QUANTUM FUNCTIONS
From MaRDI portal
Publication:5696940
DOI10.1142/S0129054103002047zbMath1101.68593OpenAlexW2952369254MaRDI QIDQ5696940
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054103002047
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items
Complexity Bounds of Constant-Space Quantum Computation, Unnamed Item, Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability, A structured view on weighted counting with relations to counting, quantum computation and applications, Exponentially more concise quantum recognition of non-RMM regular languages, Approximate counting for complex-weighted Boolean constraint satisfaction problems, How does adiabatic quantum computation fit into quantum automata theory?
Cites Work
- Unnamed Item
- Computing functions with parallel queries to NP
- Random generation of combinatorial structures from a uniform distribution
- The complexity of optimization problems
- Gap-definable counting classes
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\)
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- A complexity theory for feasible closure properties
- Local Transition Functions of Quantum Turing Machines
- Quantum computational networks
- Positive Relativizations of Complexity Classes
- Bounded Query Classes
- On Approximation Algorithms for # P
- Quantitative Relativizations of Complexity Classes
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum computations: algorithms and error correction
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computability
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Oracle Quantum Computing
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
- Logical Reversibility of Computation
