Quantum algorithm design: techniques and applications
From MaRDI portal
Publication:1730317
DOI10.1007/s11424-019-9008-0zbMath1409.81033OpenAlexW2913472259MaRDI QIDQ1730317
Yang Li, Changpeng Shao, Hong-Bo Li
Publication date: 6 March 2019
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-019-9008-0
Searching and sorting (68P10) Sums of independent random variables; random walks (60G50) Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Mathematical problems of computer architecture (68M07)
Related Items
Improvement of quantum walks search algorithm in single-marked vertex graph, A low failure rate quantum algorithm for searching maximum or minimum, Quantum QR decomposition in the computational basis, Quantum context-aware recommendation systems based on tensor singular value decomposition, Foreword to the special issue, Discrete-time quantum walk with memory on the Cayley graph of the dihedral group, An improved quantum network communication model based on compressed tensor network states, A hybrid algorithm to solve linear systems of equations with limited qubit resources, Quantum speedup of Bayes’ classifiers
Uses Software
Cites Work
- Quantum walks can find a marked element on any graph
- The staggered quantum walk model
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- The quest for a quantum neural network
- Improved quantum query algorithms for triangle detection and associativity testing
- Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
- On the relationship between continuous- and discrete-time quantum walk
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Simulating a perceptron on a quantum computer
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases
- Geometric algorithms and combinatorial optimization
- From quantum cellular automata to quantum lattice gases
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum walks: a comprehensive review
- Combinatorics
- Supervised learning with quantum computers
- Fault-tolerant quantum computation by anyons
- On the complexity of solving quadratic Boolean systems
- Quantum search with variable times
- Simulation of a multidimensional input quantum perceptron
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Progress in quantum algorithms
- The quantum query complexity of the hidden subgroup problem is polynomial
- Quantum adiabatic machine learning
- On the hitting times of quantum versus random walks
- Discrete quantum walks hit exponentially faster
- An example of the difference between quantum and classical random walks
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Quantum Fourier transform over symmetric groups -- improved result
- Quantum complexity of testing group commutativity
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Finding, Minimizing, and Counting Weighted Subgraphs
- BQP and the polynomial hierarchy
- Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
- Span-program-based quantum algorithm for evaluating formulas
- Quantum fourier transform over symmetric groups
- Search via Quantum Walk
- Discrete-query quantum algorithm for NAND trees
- Quantum computational networks
- Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
- Simulating Sparse Hamiltonians with Star Decompositions
- Universal Quantum Simulators
- Bulk Spin-Resonance Quantum Computation
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Random Access Memory
- Locally Weighted Regression: An Approach to Regression Analysis by Local Fitting
- Efficient Convex Optimization with Oracles
- QUANTUM WALKS ON GENERAL GRAPHS
- Quantum Algorithms for Some Hidden Shift Problems
- Algorithms for Black-Box Fields and their Application to Cryptography
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum Walk Based Search Algorithms
- A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- The Symmetric Group Defies Strong Fourier Sampling
- The quantum adiabatic optimization algorithm and local minima
- Adiabatic quantum state generation and statistical zero knowledge
- Exponential algorithmic speedup by a quantum walk
- Quantum verification of matrix products
- New Developments in Quantum Algorithms
- Optimal measurements for the dihedral hidden subgroup problem
- Robust Locally Weighted Regression and Smoothing Scatterplots
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Quantum machine learning: a classical perspective
- New directions in nearest neighbor searching with applications to lattice sieving
- A Parallel Quantum Algorithm for the Satisfiability Problem
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
- Quantum Computation and Lattice Problems
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- Topological quantum computation
- Quantum States of Hierarchic Systems
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Faster quantum-walk algorithm for the two-dimensional spatial search
- Fixed-Point Quantum Search
- Quantum Query Complexity of Minor-Closed Graph Properties
- Quantum Algorithms for the Subset-Sum Problem
- Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
- Toward the first quantum simulation with quantum speedup
- Classical Verification of Quantum Computations
- Controlled Quantum Amplification
- Quantum mixing of Markov chains for special distributions
- One-dimensional quantum walks
- Quantum walks on graphs
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for Matrix Products over Semirings
- Quantum Algorithms for the Triangle Problem
- Quantum Computation and the Evaluation of Tensor Networks
- Constructing elliptic curve isogenies in quantum subexponential time
- Span programs for functions with constant-sized 1-certificates
- New lattice-based cryptographic constructions
- The Quantum Query Complexity of Algebraic Properties
- Quantum Walk Algorithm for Element Distinctness
- Quantum Query Complexity of Some Graph Problems
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Nested Quantum Walks with Quantum Data Structures
- Methods of conjugate gradients for solving linear systems
- Quantum cryptanalysis of hash and claw-free functions
- A polynomial quantum algorithm for approximating the Jones polynomial
- Limitations of quantum coset states for graph isomorphism
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- On quantum algorithms for noncommutative hidden subgroups
- Quantum simulations of classical random walks and undirected graph connectivity
- The elements of statistical learning. Data mining, inference, and prediction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
