On the Power of Quantum Computation
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Quantum model of computations: Underlying principles and achievements
- Physical quantum algorithms
- Improved quantum circuit modelling based on Heisenberg representation
- Quantum algorithms for the \(k\)-XOR problem
- Optimal separation in exact query complexities for Simon's problem
- Quantum algorithm to solve function inversion with time-space trade-off
- Nonadaptive quantum query complexity
- Global multipartite entanglement dynamics in Grover's search algorithm
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Simultaneous classification of Oranges and Apples using Grover's and Ventura' algorithms in a two-qubits system
- New maximally entangled states for pattern-association through evolutionary processes in a two-qubit system
- Quantum algorithm design: techniques and applications
- Quantum key-recovery on full AEZ
- Quantum key search with side channel advice
- Almost-everywhere superiority for quantum polynomial time
- One complexity theorist's view of quantum computing
- A lower bound on the quantum query complexity of read-once functions
- Complexity limitations on quantum computation
- Space-bounded quantum complexity
- A Hamiltonian for quantum copying
- Quantum algorithm to find invariant linear structure of MD hash functions
- Breaking tweakable enciphering schemes using Simon's algorithm
- Evaluation of exact quantum query complexities by semidefinite programming
- Quantum algorithms for learning Walsh spectra of multi-output Boolean functions
- Quantum cryptographic property testing of multi-output Boolean functions
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys
- Quantum absentminded driver problem revisited
- Leveraging the hardness of dihedral coset problem for quantum cryptography
- Some efficient quantum circuit implementations of Camellia
- Improved BV-based quantum attack on block ciphers
- A fusion algorithm for solving the hidden shift problem in finite abelian groups
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Post-quantum security of the Even-Mansour cipher
- Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256
- Quantum attacks on some Feistel block ciphers
- Quantum attacks on sum of Even-Mansour pseudorandom functions
- Quantum algorithms for the resiliency of vectorial Boolean functions
- Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization
- On exact quantum query complexity
- The quantum query complexity of the abelian hidden subgroup problem
- Progress in quantum algorithms
- The quantum query complexity of the hidden subgroup problem is polynomial
- Classification of patterns representing apples and oranges in three-qubit system
- Quantum image processing?
- Efficient slide attacks
- Using Bernstein-Vazirani algorithm to attack block ciphers
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
- Maximally entangled states of a two-qubit system
- Efficient protocol of \(N\)-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator
- Improved bounds on quantum learning algorithms
- Determining the equivalence for one-way quantum finite automata
- Discrete quantum walks hit exponentially faster
- The effect of electric field on RbCl asymmetric Gaussian potential quantum well qubit
- Quantum and classical query complexities for generalized Simon's problem
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Complete analysis of Simon's quantum algorithm with additional collisions
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
- Quantum algorithms for the Goldreich-Levin learning problem
- A quantum distinguisher for 7/8-round SMS4 block cipher
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations
- Applications of Simon's algorithm in quantum attacks on Feistel variants
- Configurable sublinear circuits for quantum state preparation
- Quantum dimensionality reduction by linear discriminant analysis
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms
- Quantum circuit implementations of AES with fewer qubits
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Quantum all-subkeys-recovery attacks on 6-round Feistel-2^ structure based on multi-equations quantum claw finding
- A generalisation of the phase kick-back
- Quantum key-length extension
- Relationships between quantum IND-CPA notions
- scientific article; zbMATH DE number 1583884 (Why is no real title available?)
- Superlinear advantage for exact quantum algorithms
- Breaking symmetric cryptosystems using quantum period finding
- Potential of quantum finite automata with exact acceptance
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
- Quantum algorithms for algebraic problems
- Quantum property testing for bounded-degree graphs
- scientific article; zbMATH DE number 5968445 (Why is no real title available?)
- Entanglement is not necessary for perfect discrimination between unitary operations
- Quantum adversary lower bound for element distinctness with small range
- The road to quantum computational supremacy
- Quantum computation and quantum information†
- Optimization of \(S\)-boxes GOST R 34.12-2015 ``Magma quantum circuits without ancilla qubits
- Quantum computing: beyond the limits of conventional computation†
- Complexity considerations quantum computation
- Multi-query quantum sums
- The Limits of Quantum Computers
- Matchgates and classical simulation of quantum circuits
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the uselessness of quantum queries
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Strengths and Weaknesses of Quantum Computing
- scientific article; zbMATH DE number 1464668 (Why is no real title available?)
This page was built for publication: On the Power of Quantum Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376181)
