On the Power of Quantum Computation
From MaRDI portal
Publication:4376181
DOI10.1137/S0097539796298637zbMath0883.03024OpenAlexW2117584890MaRDI QIDQ4376181
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539796298637
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)
Related Items (only showing first 100 items - show all)
On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ An Optimal Separation of Randomized and Quantum Query Complexity ⋮ A public key cryptosystem based on data complexity under quantum environment ⋮ Multi-query Quantum Sums ⋮ Trading quantum for classical resources in quantum data compression ⋮ Quantum security analysis of Rocca ⋮ New results on quantum boomerang attacks ⋮ Quantum meet-in-the-middle attack on Feistel construction ⋮ Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Quantum cryptanalysis of 5 rounds Feistel schemes and Benes schemes ⋮ Following forrelation -- quantum algorithms in exploring Boolean functions' spectra ⋮ Quantum attacks on generalized Feistel networks based on the strong-weak separability ⋮ Quantum circuit implementation and resource analysis of LBlock and LiCi ⋮ Optimized quantum implementation of AES ⋮ A family of unitaries for the quantum period finding algorithm ⋮ Rapid solution of problems by quantum computation ⋮ Quantum algorithm for smoothed particle hydrodynamics ⋮ A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle ⋮ Post-quantum security on the Lai-Massey scheme ⋮ Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks ⋮ Introducing nega-forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra ⋮ Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms ⋮ Shor's Factoring Algorithm and Modular Exponentiation Operators ⋮ A quantum algorithm to approximate the linear structures of Boolean functions ⋮ Quantum linearization attacks ⋮ FAST: secure and high performance format-preserving encryption and tokenization ⋮ Quantum attacks on Lai-Massey structure ⋮ Post-quantum plaintext-awareness ⋮ Quantum attacks on beyond-birthday-bound MACs ⋮ Tsallis relative α entropy of coherence dynamics in Grover′s search algorithm ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Two remarks on the vectorization problem ⋮ Quantum circuit implementations of SM4 block cipher based on different gate sets ⋮ Further insights on constructing quantum circuits for Camellia block cipher ⋮ On the post-quantum security of classical authenticated encryption schemes ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An FPGA-based quantum circuit emulation framework using heisenberg representation ⋮ Quantum Query Algorithms are Completely Bounded Forms. ⋮ EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE ⋮ An Introduction to Quantum Computing, without the Physics ⋮ EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM ⋮ ANALYSIS OF QUANTUM FUNCTIONS ⋮ The Road to Quantum Computational Supremacy ⋮ Quantum Query Algorithms Are Completely Bounded Forms ⋮ Quantum and classical query complexities of local search are polynomially related ⋮ Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians ⋮ Matchgates and classical simulation of quantum circuits ⋮ Modular quantum computing and quantum-like devices ⋮ Revisiting the simulation of quantum Turing machines by quantum circuits ⋮ On quantum algorithms for noncommutative hidden subgroups ⋮ ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM ⋮ Counting by quantum eigenvalue estimation ⋮ Quantum computation: algorithms and applications ⋮ Unnamed Item ⋮ Analogies and differences between quantum and stochastic automata ⋮ Quantum computation and quantum information† ⋮ Optimization of $S$-boxes GOST R 34.12-2015 «Magma» quantum circuits without ancilla qubits ⋮ On Quantum Chosen-Ciphertext Attacks and Learning with Errors ⋮ Unnamed Item ⋮ Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations ⋮ Generation of elementary gates and Bell’s states using controlled adiabatic evolutions ⋮ Quantum Algorithms for a Set of Group Theoretic Problems ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Physical quantum algorithms ⋮ The effect of electric field on RbCl asymmetric Gaussian potential quantum well qubit ⋮ Improved quantum circuit modelling based on Heisenberg representation ⋮ A lower bound on the quantum query complexity of read-once functions ⋮ (Quantum) cryptanalysis of misty schemes ⋮ A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs ⋮ Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables ⋮ The quantum query complexity of the abelian hidden subgroup problem ⋮ On the black-box complexity of Sperner's Lemma ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Progress in quantum algorithms ⋮ The quantum query complexity of the hidden subgroup problem is polynomial ⋮ Quantum computing without entanglement ⋮ The query complexity of order-finding ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Post-quantum security of the Even-Mansour cipher ⋮ Optimal separation in exact query complexities for Simon's problem ⋮ Quantum algorithm to solve function inversion with time-space trade-off ⋮ Optimal parallel quantum query algorithms ⋮ Nonadaptive quantum query complexity ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Classification of patterns representing apples and oranges in three-qubit system ⋮ Quantum image processing? ⋮ Quantum attacks on some Feistel block ciphers ⋮ Efficient slide attacks ⋮ Using Bernstein-Vazirani algorithm to attack block ciphers ⋮ Quantum and classical query complexities for generalized Simon's problem ⋮ Potential of Quantum Finite Automata with Exact Acceptance ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ Complete analysis of Simon's quantum algorithm with additional collisions ⋮ Mathematical model of stored logic based computation ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions
This page was built for publication: On the Power of Quantum Computation
