Quantum complexity theory
From MaRDI portal
Cited in
(88)- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- Recursive information transducers: Computation models
- Testing the shift-equivalence of polynomials using quantum machines
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- On the simulation of quantum Turing machines.
- New quantum algorithm for studying NP-complete problems
- Quantum search on structured problems
- Stochastic analog networks and computational complexity
- Quantum computation based on retarded and advanced propagation.
- A framework for structured quantum search.
- Quantum model of computations: Underlying principles and achievements
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Efficient quantum algorithms of finding the roots of a polynomial function
- Circuit complexity in interacting QFTs and RG flows
- Creating very true quantum algorithms for quantum energy based computing
- A classical probability space exists for the measurement theory based on the truth values
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- New quantum algorithm solving the NP complete problem
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth
- Regular languages accepted by quantum automata
- Quantum entanglement as a new information processing resource
- Quantum algorithm for determining a complex number string
- Improved BV-based quantum attack on block ciphers
- Efficient computation of permanents, with applications to boson sampling and random matrices
- Generalization of Deutsch's algorithm
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Physics' evolution toward computing
- Some theoretically organized algorithm for quantum computers
- Quantum algorithm for the root-finding problem
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Kochen-Specker theorem as a precondition for quantum computing
- Time evolution of complexity: a critique of three methods
- Computational universes
- Quantum learning Boolean linear functions w.r.t. product distributions
- Quantum algorithms for the Goldreich-Levin learning problem
- Quantum computation with coherent spin states and the close Hadamard problem
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- The road to quantum computational supremacy
- Analytical error analysis of Clifford gates by the fault-path tracer method
- Y-calculus: a language for real matrices derived from the ZX-calculus
- Monoidal computer. I: Basic computability by string diagrams
- Computational complexity and applications of quantum algorithm
- Necessary and Sufficient Conditions for Quantum Computation
- Oracle Quantum Computing
- A quantum algorithm to approximate the linear structures of Boolean functions
- Local random quantum circuits are approximate polynomial-designs
- Quantum differential and linear cryptanalysis
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Quantum finite automata: advances on Bertoni's ideas
- Counting by quantum eigenvalue estimation
- Distributed Bernstein-Vazirani algorithm
- Channel divergences and complexity in algebraic QFT
- A user-centric quantum benchmarking test suite and evaluation framework
- Commuting quantum circuits and complexity of Ising partition functions
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Quaternionic quantum automata
- QCB: efficient quantum-secure authenticated encryption
- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
- Quantum process tomography on cloud-accessible quantum computing platforms
- Mathematical digital quantum computation by means of much more logical skills
- Zero-correlation linear analysis for block ciphers based on the Bernstein-Vazirani and Grover algorithms
- Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function
- Generalization of the Bernstein-Vazirani algorithm beyond qubit systems
- Homomorphic encryption of the k = 2 Bernstein-Vazirani algorithm
- Theoretical computer science: computational complexity
- NISQ-friendly measurement-based quantum clustering algorithms
- The quadratic speedup in Grover's search algorithm from the entanglement perspective
- Recovering the original simplicity: succinct and exact quantum algorithm for the welded tree problem
- Reversible simulation of space-bounded computations
- Full-phase distributed quantum impossible differential cryptanalysis
- Formal reasoning about Bernstein-Vazirani algorithm
- BQP, meet NP: search-to-decision reductions and approximate counting
- Quantum cryptanalysis of the KB-256 block cipher
- ArtA: automating design space exploration of spin-qubit architectures
- Quantum optimization of coherent chaotic systems: a case for buses of Kathmandu
- A quantum approach for optimal control
- Disentangling the gap between quantum and \#SAT
- Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems
- Verifiable quantum advantage without structure
- Full-phase distributed quantum differential cryptanalysis and its variants on block ciphers
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Quantum spectral method for gradient and Hessian estimation
- Quantum mechanics and computation
- Quantum loop programs
- The geometry of quantum learning
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 Q5248467)
