12 citations · 20 across the 9 of their papers we have counts for
4 papers · 1 filter
Fault-tolerant cost of shallow QAOA on near-symmetric optimization problems
Jernej Rudi Finžgar, Martin Leib, Elisabeth Wybo
Montanaro and Zhou proved that depth-one Quantum Approximate Optimization Algorithm (QAOA) finds the planted solution of certain near-symmetric constraint satisfaction problems wit…
Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm
Jiří Guth Jarkovský, Patricia Bickert, Elisabeth Wybo +1
Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In thi…
Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware
Shin Ho Choe, Vincent Steffan, Florian Vigneau +5
The major challenge on the way to fault-tolerant quantum computing comes from the insufficient quality of hardware components and the difficulty of scaling their number without fur…
A scalable quantum-enhanced greedy algorithm for maximum independent set problems
Elisabeth Wybo, Jami Rönkkö, Olli Hirviniemi +2
We investigate a hybrid quantum-classical algorithm for solving the Maximum Independent Set (MIS) problem on regular graphs, combining the Quantum Approximate Optimization Algorith…