12 citations · 20 across the 9 of their papers we have counts for
11 papers
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…
Opportunities and challenges of quantum computing for climate modelling
Mierk Schwabe, Lorenzo Pastori, Inés de Vega +6
Adaptation to climate change requires robust climate projections, yet the uncertainty in these projections performed by ensembles of Earth system models (ESMs) remains large. This…
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…
Performance and scaling analysis of variational quantum simulation
Mario Ponce, Thomas Cope, Inés de Vega +1
We present an empirical analysis of the scaling of the minimal quantum circuit depth required for a variational quantum simulation (VQS) method to obtain a solution to the time evo…
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…
Improved Qubit Routing for QAOA Circuits
Ayse Kotil, Fedor Simkovic, Martin Leib
We develop a qubit routing algorithm with polynomial classical run time for the Quantum Approximate Optimization Algorithm (QAOA). The algorithm follows a two step process. First,…
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-…
TensorFlow Quantum: A Software Framework for Quantum Machine Learning
Michael Broughton, Guillaume Verdon, Trevor McCourt +26
We introduce TensorFlow Quantum (TFQ), an open source library for the rapid prototyping of hybrid quantum-classical models for classical or quantum data. This framework offers high…