106 citations · 167 across the 17 of their papers we have counts for
17 papers
Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting
Filip B. Maciejewski, Stuart Hadfield, Oscar Wallis +5
Progress towards a quantum advantage using known heuristic methods for combinatorial optimization is impeded by hardware noise and limited qubit count. Here, we propose a noise-awa…
Quench Spectroscopy of Magnetic Excitations on a Superconducting Quantum Processor
D. A. Millar, G. W. Pennington, N. T. M. Siow +5
The elementary excitation spectrum of a many-body quantum system encodes many key properties, including phenomena as diverse as transport, thermalisation and ground state structure…
Setting angles in quantum approximate optimization at utility-scale
Maosheng Guo, Joel Jurado Diaz, Anurag Ramesh +16
The quantum approximate optimization algorithm (QAOA) is a powerful heuristic that seeks to solve combinatorial optimization problems using quantum hardware and classical optimizat…
Quantum-enhanced Markov Chain Monte Carlo for Combinatorial Optimization
Kate V. Marshall, Daniel J. Egger, Michael Garn +4
Quantum computing offers an alternative paradigm for addressing combinatorial optimization problems compared to classical computing. Despite recent hardware improvements, the execu…
Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors
Arseny Kovyrshin, Dilhan Manawadu, Edoardo Altamura +15
Proton transfer reactions are fundamental to many chemical and biological systems, where quantum effects such as tunneling, delocalization, and zero-point motion play key kinetic c…
Hardware-Efficient Preparation of Graph States on Near-Term Quantum Computers
Sebastian Brandhofer, Ilia Polian, Stefanie Barz +1
Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available qua…
Benchmarking the performance of quantum computing software
Paul D. Nation, Abdullah Ash Saki, Sebastian Brandhofer +4
We present Benchpress, a benchmarking suite for evaluating the performance and range of functionality of multiple quantum computing software development kits. This suite consists o…
Optimal Partitioning of Quantum Circuits using Gate Cuts and Wire Cuts
Sebastian Brandhofer, Ilia Polian, Kevin Krsulich
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides…
Optimal Qubit Reuse for Near-Term Quantum Computers
Sebastian Brandhofer, Ilia Polian, Kevin Krsulich
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset i…
Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
Sebastian Brandhofer, Simon Devitt, Thomas Wellens +1
First quantum computers very recently have demonstrated "quantum supremacy" or "quantum advantage": Executing a computation that would have been impossible on a classical machine.…
SAT-Based Quantum Circuit Adaptation
Sebastian Brandhofer, Jinwoong Kim, Siyuan Niu +1
As the nascent field of quantum computing develops, an increasing number of quantum hardware modalities, such as superconducting electronic circuits, semiconducting spins, trapped…
Error Analysis of the Variational Quantum Eigensolver Algorithm
Sebastian Brandhofer, Simon Devitt, Ilia Polian
Variational quantum algorithms have been one of the most intensively studied applications for near-term quantum computing applications. The noisy intermediate-scale quantum (NISQ)…
Multiplexed Pseudo-Deterministic Photon Source with Asymmetric Switching Elements
Sebastian Brandhofer, Casey R. Myers, Simon J. Devitt +1
The reliable, deterministic production of trustworthy high-quality single photons is a critical component of discrete variable, optical quantum technology. For single-photon based…
ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures
Sebastian Brandhofer, Simon Devitt, Ilia Polian
While scalable, fully error corrected quantum computing is years or even decades away, there is considerable interest in noisy intermediate-scale quantum computing (NISQ). In this…
Benchmarking the performance of portfolio optimization with QAOA
Sebastian Brandhofer, Daniel Braun, Vanessa Dehn +6
We present a detailed study of portfolio optimization using different versions of the quantum approximate optimization algorithm (QAOA). For a given list of assets, the portfolio o…
Calibration-Aware Transpilation for Variational Quantum Optimization
Yanjun Ji, Sebastian Brandhofer, Ilia Polian
Today's Noisy Intermediate-Scale Quantum (NISQ) computers support only limited sets of available quantum gates and restricted connectivity. Therefore, quantum algorithms must be tr…
Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms
Sebastian Brandhofer, Hans Peter Büchler, Ilia Polian
Quantum algorithms promise quadratic or exponential speedups for applications in cryptography, chemistry and material sciences. The topologies of today's quantum computers offer li…