Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Progress in Quantum Algorithms

Peter W. Shor

Published Oct 1, 2004• 62 citations
Publisher
DOI
10.1007/s11128-004-3878-2

Related papers

Progress in Quantum Algorithms

Peter W. Shor

Springer eBooks•Apr 2, 2007•3 citations

Progressive quantum algorithm for maximum independent set with quantum alternating operator ansatz

Xiao‐Hui Ni, Ling-Xiao 凌霄 Li 李, Yanqi Song +3 more

Abstract The quantum alternating operator ansatz algorithm (QAOA+) is widely used for constrained combinatorial optimization problems (CCOPs) due to its ability to construct feasible solution spaces. In this paper, we propose a progressive quantum algorithm (PQA) to reduce qubit requirements for QAOA+ in solving the maximum independent set (MIS) problem. PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution. Specifically, PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies. After each expansion, PQA solves the MIS problem on the newly generated subgraph using QAOA+. In each run, PQA repeats the expansion and solving process until a predefined stopping condition is reached. Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57% (2.17%) of the qubits and 17.59% (6.43%) of the runtime compared with directly solving the original problem with QAOA+ on Erdös–Rényi (3-regular) graphs, highlighting the efficiency and scalability of PQA.

arXiv:2405.04303•Chinese Physics B•May 28, 2025•9 citations

New Developments in Quantum Algorithms

Andris Ambainis

arXiv:1006.4014•Lecture notes in computer science•Jan 1, 2010•10 citations

The Research Progress in Quantum Algorithms

Wei Li

This essay mainly introduced Shor algorithm,Grover quantum evolution algorithm and the progress of quantum evolution algorithm based on quantum algorithm theory.It expounded the major problems and research prospect which quantum algorithm had to confront.

Journal of Baicheng Normal University•Jan 1, 2011•0 citations

Introduction to Recent Quantum Algorithms

Peter Høyer

Lecture notes in computer science•Jan 1, 2001•7 citations

Decoder Optimised Progressive Edge Growth Algorithm

Cornelius T. Healy, Rodrigo C. de Lamare

A novel construction for irregular low density parity check (LDPC) codes based on a modification of the Progressive Edge Growth (PEG) algorithm is presented. The edge placement procedure of the PEG algorithm is enhanced by the use of the Sum-Product decoder in the design of the parity-check matrix. The proposed algorithm, like the PEG algorithm, is highly flexible in block length and rate. The codes constructed by the methods presented are tested in the AWGN channel and significant performance improvements are achieved. The flexibility of the proposed decoder optimisation operation in its application to PEG-based construction methods is then demonstrated by its use in modifying the Improved PEG (IPEG) extension to the PEG algorithm to achieve further performance gains.

IEEE Vehicular Technology Conference•May 1, 2011•5 citations
Abstract The quantum alternating operator ansatz algorithm (QAOA+) is widely used for constrained combinatorial optimization problems (CCOPs) due to its ability to construct feasible solution spaces. In this paper, we propose a progressive quantum algorithm (PQA) to reduce qubit requirements for QAOA+ in solving the maximum independent set (MIS) problem. PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution. Specifically, PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies. After each expansion, PQA solves the MIS problem on the newly generated subgraph using QAOA+. In each run, PQA repeats the expansion and solving process until a predefined stopping condition is reached. Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57% (2.17%) of the qubits and 17.59% (6.43%) of the runtime compared with directly solving the original problem with QAOA+ on Erdös–Rényi (3-regular) graphs, highlighting the efficiency and scalability of PQA.
A novel construction for irregular low density parity check (LDPC) codes based on a modification of the Progressive Edge Growth (PEG) algorithm is presented. The edge placement procedure of the PEG algorithm is enhanced by the use of the Sum-Product decoder in the design of the parity-check matrix. The proposed algorithm, like the PEG algorithm, is highly flexible in block length and rate. The codes constructed by the methods presented are tested in the AWGN channel and significant performance improvements are achieved. The flexibility of the proposed decoder optimisation operation in its application to PEG-based construction methods is then demonstrated by its use in modifying the Improved PEG (IPEG) extension to the PEG algorithm to achieve further performance gains.