Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
From MaRDI portal
Publication:6107781
DOI10.1007/s11128-023-04010-4MaRDI QIDQ6107781
Kun Liang, Zhaocai Wang, Tunhua Wu, Xiaoguang Bao
Publication date: 3 July 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
NP-complete problemsquantum computingquantum circuitGrover search algorithmminimum vertex cover problem
Cites Work
- Unnamed Item
- Unnamed Item
- On the hardness of approximating minimum vertex cover
- Using modifications to Grover's search algorithm for quantum global optimization
- Single machine precedence constrained scheduling is a Vertex cover problem
- Quantum mechanical Hamiltonian models of Turing machines
- A quantum-implementable neural network model
- Quantum particle swarm optimization algorithm with the truncated mean stabilization strategy
- Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation
- Improved classical and quantum algorithms for subset-sum
- Learning algorithm and application of quantum BP neural networks based on universal quantum gates
- Grover quantum searching algorithm based on weighted targets
- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A new technique for optimization problems in graph theory
- A Parallel Quantum Algorithm for the Satisfiability Problem
- Quantum cryptanalysis of hash and claw-free functions
This page was built for publication: Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
