Quantum Complexity Theory
From MaRDI portal
Publication:4376183
Recommendations
Cited in
(only showing first 100 items - show all)- On using probabilistic Turing machines to model participants in cryptographic protocols
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- Superiority of exact quantum automata for promise problems
- Quantum algorithms for algebraic problems
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
- Quantum algorithmic randomness
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Computational Complexity of Projected Entangled Pair States
- Quantum computing and quadratically signed weight enumerators
- On the impossibility of interaction-free quantum sensing for small I/O bandwidth
- Analogies and differences between quantum and stochastic automata
- Wave-style token machines and quantum lambda calculi
- Optimal quantum sample complexity of learning algorithms
- Blind quantum machine learning based on quantum circuit model
- The quantum ultimatum game
- Power of quantum computation with few clean qubits
- A search for quantum coin-flipping protocols using optimization techniques
- Quantum cryptographic property testing of multi-output Boolean functions
- Polynomial time quantum computation with advice
- Machine semantics
- Quantum circuit oracles for abstract machine computations
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- A new universal and fault-tolerant quantum basis
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- Mathematical models of quantum computation
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Complexity of operators generated by quantum mechanical Hamiltonians
- Unbounded-error quantum computation with small space bounds
- Quantum meet-in-the-middle attack on Feistel construction
- Quantum computing, postselection, and probabilistic polynomial-time
- Simplified proof of the Fourier sampling theorem
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- scientific article; zbMATH DE number 7561760 (Why is no real title available?)
- Martin-Löf random quantum states
- Quantum algorithm design: techniques and applications
- Quantum algorithms for learning symmetric juntas via the adversary bound
- NMR quantum computing
- Approximation and universality of fuzzy Turing machines
- Quantum Boolean image denoising
- A full characterization of quantum advice
- An improved quantum algorithm for the quantum learning with errors problem
- Quantum algorithm for learning secret strings and its experimental demonstration
- scientific article; zbMATH DE number 5049912 (Why is no real title available?)
- Succinct classical verification of quantum computation
- An exact quantum logarithmic time algorithm for the 3-junta problem
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- Quantum algorithm to solve function inversion with time-space trade-off
- A probabilistic model of computing with words
- Universality of quantum Turing machines with deterministic control
- An exact quantum algorithm for the 2-junta problem
- Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
- On exact quantum query complexity
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- Quantum algorithms for learning and testing juntas
- ON THE QUANTUM KOLMOGOROV COMPLEXITY OF CLASSICAL STRINGS
- Trace monoids with idempotent generators and measure-only quantum automata
- Temporally unstructured quantum computation
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product
- Mathematical digital quantum computation by means of much more logical skills
- Generalization of the Bernstein-Vazirani algorithm beyond qubit systems
- Approximation of fuzzy context-free grammars
- Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy
- Undecidability of the Spectral Gap
- Classical simulation complexity of quantum machines.
- The query complexity of order-finding
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- A theoretical framework for quantum image representation and data loading scheme
- Unbounded-error quantum query complexity
- Classically controlled quantum computation
- Quantum simulations of classical random walks and undirected graph connectivity
- Quantum computation: algorithms and applications
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- Quantum algorithm for determining a complex number string
- Quantum Kolmogorov complexity
- THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
- The quantum setting with randomized queries for continuous problems
- Quantum counterfeit coin problems
- Verification of quantum computation: an overview of existing approaches
- Automata theory based on quantum logic: Some characterizations
- A prototype of quantum von Neumann architecture
- Quantum communication and complexity.
- On a measurement-free quantum lambda calculus with classical control
- Partial observation of quantum Turing machines and a weaker well-formedness condition
- Physics' evolution toward computing
- Quantum cryptography based on an algorithm for determining simultaneously all the mappings of a Boolean function
- The quantum query complexity of learning multilinear polynomials
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Remarks on universal quantum computer
- Quantum principles and mathematical computability
- Complexity limitations on quantum computation
- Models of quantum computation and quantum programming languages
- Quantum image processing?
- Simulating fermions on a quantum computer
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Computational Depth Complexity of Measurement-Based Quantum Computation
- A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
- Quantum algorithm for the root-finding problem
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)
