46 citations · 157 across the 15 of their papers we have counts for
8 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…
Quantum-informed surrogate sampling for combinatorial optimization
Elisabeth Wybo, Jernej Rudi Finžgar
We introduce Quantum-Informed Surrogate Sampling (QISS), a post-processing framework that generates candidate solutions to combinatorial optimization problems from low-weight corre…
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…
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…
A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity
Michael Renger, Jeroen Verjauw, Nicola Wurz +62
In this work we introduce a superconducting quantum processor architecture that uses a transmission-line resonator to implement effective all-to-all connectivity between six transm…
Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer
Leonid Abdurakhimov, Janos Adam, Hasnain Ahmad +111
Quantum computing has tremendous potential to overcome some of the fundamental limitations present in classical information processing. Yet, today's technological limitations in th…
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm
Elisabeth Wybo, Martin Leib
We consider the maximum cut and maximum independent set problems on random regular graphs in the infinite-size limit, and calculate the energy densities achieved by QAOA for high d…
Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models
Elisabeth Wybo, Martin Leib
The parity mapping provides a geometrically local encoding of the Quantum Approximate Optimization Algorithm (QAOA), at the expense of having a quadratic qubit overhead for all-to-…