ANALYSIS OF QUANTUM FUNCTIONS
From MaRDI portal
Publication:5696940
DOI10.1142/S0129054103002047zbMATH Open1101.68593OpenAlexW2952369254MaRDI QIDQ5696940FDOQ5696940
Authors: Tomoyuki Yamakami 
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
Recommendations
- scientific article; zbMATH DE number 1500664
- Quantum functional analysis. Non-coordinate approach
- Quantum Fourier analysis
- A compositional approach to quantum functions
- scientific article; zbMATH DE number 4096174
- Q-analytic functions on quantum spaces
- Fourier type analysis and quantum mechanics
- scientific article; zbMATH DE number 2050862
- Analytic representations in quantum mechanics
- Analyticity for some operator functions from statistical quantum mechanics
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Cites Work
- The complexity of optimization problems
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computability
- Random generation of combinatorial structures from a uniform distribution
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum computational networks
- On Approximation Algorithms for # P
- Quantum computations: algorithms and error correction
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Logical Reversibility of Computation
- Rapid solution of problems by quantum computation
- Bounded Query Classes
- Computing functions with parallel queries to NP
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
- Quantitative Relativizations of Complexity Classes
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
- Gap-definable counting classes
- A complexity theory for feasible closure properties
- Positive Relativizations of Complexity Classes
- Oracle Quantum Computing
- Title not available (Why is that?)
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Local transition functions of quantum Turing machines
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\)
Cited In (11)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Exponentially more concise quantum recognition of non-RMM regular languages
- Complexity bounds of constant-space quantum computation
- A compositional approach to quantum functions
- How does adiabatic quantum computation fit into quantum automata theory?
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- One-way topological automata and the tantalizing effects of their topological features
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Function package for computing quantum resource measures
This page was built for publication: ANALYSIS OF QUANTUM FUNCTIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696940)
