Quantum Complexity Theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Some algebraic properties of measure-once two-way quantum finite automata
- A new connection between quantum circuits, graphs and the Ising partition function
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Weakly regular quantum grammars and asynchronous quantum automata
- A note on quantum sequential machines
- Theory of one-tape linear-time Turing machines
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Quantum implicit computational complexity
- Quantum lower bounds for the Goldreich-Levin problem
- An oracle builder's toolkit
- Exact results for accepting probabilities of quantum automata.
- Hypercomputation with quantum adiabatic processes
- Quantum computing and quadratically signed weight enumerators
- Quantum neural networks
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Simplified proof of the Fourier sampling theorem
- Physical quantum algorithms
- Simulating fermions on a quantum computer
- Efficient quantum algorithms of finding the roots of a polynomial function
- Creating very true quantum algorithms for quantum energy based computing
- Quantum algorithm to solve function inversion with time-space trade-off
- Nonadaptive quantum query complexity
- Quantum arithmetic with the quantum Fourier transform
- The complexity of translationally invariant spin chains with low local dimension
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- An improved filtering method for quantum color image in frequency domain
- A classical probability space exists for the measurement theory based on the truth values
- Quantum algorithm design: techniques and applications
- Efficient quantum algorithm for the parity problem of a certain function
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- Uniformity of quantum circuit families for error-free algorithms
- A probabilistic model of computing with words
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Architecture of a deterministic quantum central processing unit
- Computing with quanta -- impacts of quantum theory on computation.
- Quantum communication and complexity.
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth
- Almost-everywhere superiority for quantum polynomial time
- Mathematical models of quantum computation
- One complexity theorist's view of quantum computing
- A new protocol and lower bounds for quantum coin flipping
- Human rationality challenges universal logic
- An improved lower bound on query complexity for quantum PAC learning
- Complexity limitations on quantum computation
- Space-bounded quantum complexity
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Quantum algorithm for determining a complex number string
- Prefix-free quantum Kolmogorov complexity
- Towards quantum computing based community detection
- Quantum random access stored-program machines
- Blind quantum machine learning based on quantum circuit model
- Quantum cryptographic property testing of multi-output Boolean functions
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- An improved quantum algorithm for the quantum learning with errors problem
- Quantum algorithm for learning secret strings and its experimental demonstration
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
- Multi-party quantum key agreement protocol for detection of collusive attacks in each sub-circle segment by headers
- A exact quantum learning algorithm for the 2-junta problem in constant time
- An exact quantum algorithm for a restricted subtraction game
- Generalization of Deutsch's algorithm
- A structured view on weighted counting with relations to counting, quantum computation and applications
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Physics' evolution toward computing
- An exact quantum algorithm for the 2-junta problem
- Models of quantum computation and quantum programming languages
- Approximation and robustness of fuzzy finite automata
- Hierarchy and equivalence of multi-letter quantum finite automata
- Some theoretically organized algorithm for quantum computers
- Verification of quantum computation: an overview of existing approaches
- Quantum algorithm for the root-finding problem
- On exact quantum query complexity
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Generality's price: Inescapable deficiencies in machine-learned programs
- The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries
- Polynomial time quantum computation with advice
- Kochen-Specker theorem as a precondition for quantum computing
- Quantum image processing?
- Using Bernstein-Vazirani algorithm to attack block ciphers
- A modeling and verification framework for optical quantum circuits
- Complexity of operators generated by quantum mechanical Hamiltonians
- Histogram-based segmentation of quantum images
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Quantum algorithms for learning and testing juntas
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem
- Computing spin networks
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- Some formal tools for analyzing quantum automata.
- Improved bounds on quantum learning algorithms
- Zeno machines and hypercomputation
- Determination of equivalence between quantum sequential machines
- Quantum principles and mathematical computability
- Error-bounded probabilistic computations between MA and AM
- Determining the equivalence for one-way quantum finite automata
- Universality and programmability of quantum computers
- The quantum ultimatum game
This page was built for publication: Quantum Complexity Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376183)
