A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
From MaRDI portal
Publication:669949
DOI10.1007/s11128-019-2171-3zbMath1417.81095arXiv1804.08227OpenAlexW2963300030WikidataQ128578232 ScholiaQ128578232MaRDI QIDQ669949
Publication date: 15 March 2019
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.08227
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ Quantum semi-trust evaluation model with graph-based quantum walk teleportation ⋮ Quantum walk and its application domains: a systematic review ⋮ QSW\_MPI: a framework for parallel simulation of quantum stochastic walks ⋮ One-dimensional quantum walks with two-step memory ⋮ On the universality of the quantum approximate optimization algorithm ⋮ A quantum blockchain-enabled framework for secure private electronic medical records in Internet of medical things ⋮ A systematic method to building Dirac quantum walks coupled to electromagnetic fields ⋮ Models in quantum computing: a systematic review
Uses Software
Cites Work
- State transfer on graphs
- A theory of measurement in diagnosis from first principles
- Physical implementation of quantum walks
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Comparing classical and quantum pageranks
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Universal Computation by Multiparticle Quantum Walk
- An analytical study of quantum walk through glued-tree graphs
- Reducibility Among Combinatorial Problems
- Strong lower bounds on the approximability of some NPO PB-complete maximization problems
- Adiabatic quantum state generation and statistical zero knowledge
- Exponential algorithmic speedup by a quantum walk
- Some better bounds on the variance with applications
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Efficient quantum circuits for diagonal unitaries without ancillas
- A Simplex Method for Function Minimization
- The fundamental limit theorems in probability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
