ANALYSIS OF QUANTUM FUNCTIONS
From MaRDI portal
Publication:5696940
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
Cites work
- scientific article; zbMATH DE number 3446988 (Why is no real title available?)
- A complexity theory for feasible closure properties
- Bounded Query Classes
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Computing functions with parallel queries to NP
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
- Gap-definable counting classes
- Local transition functions of quantum Turing machines
- Logical Reversibility of Computation
- On Approximation Algorithms for # P
- On the Power of Quantum Computation
- Oracle Quantum Computing
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Positive Relativizations of Complexity Classes
- Quantitative Relativizations of Complexity Classes
- Quantum Complexity Theory
- Quantum Computability
- Quantum computational networks
- Quantum computations: algorithms and error correction
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Random generation of combinatorial structures from a uniform distribution
- Rapid solution of problems by quantum computation
- Relativized separation of EQP from \(\text{P}^{\text{NP}}\)
- Strengths and Weaknesses of Quantum Computing
- The complexity of optimization problems
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
Cited in
(10)- A compositional approach to quantum functions
- 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
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Exponentially more concise quantum recognition of non-RMM regular languages
- Function package for computing quantum resource measures
- Complexity bounds of constant-space quantum computation
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- How does adiabatic quantum computation fit into quantum automata theory?
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)
