99 citations · 645 across the 28 of their papers we have counts for
28 papers
Low-Resource Quantum Energy Gap Estimation via Randomization
Hugo Pages, Chusei Kiumi, Yuto Morohoshi +2
Estimating the energy spectra of quantum many-body systems is a fundamental task in quantum physics, with applications ranging from chemistry to condensed matter. Algorithmic shado…
Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations
Po-Wei Huang, Gregory Boyd, Gian-Luca R. Anselmetti +11
Accurately computing the free energies of biological processes is a cornerstone of computer-aided drug design, but it is a daunting task. The need to sample vast conformational spa…
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
Zoltán Zimborás, Bálint Koczor, Zoë Holmes +19
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transitio…
Snakes on a Plane: mobile, low dimensional logical qubits on a 2D surface
Adam Siegel, Zhenyu Cai, Hamza Jnane +4
Recent demonstrations indicate that silicon-spin QPUs will be able to shuttle physical qubits rapidly and with high fidelity - a desirable feature for maximising logical connectivi…
Quantum Information Processing, Sensing and Communications: Their Myths, Realities and Futures
Lajos Hanzo, Zunaira Babar, Zhenyu Cai +6
The recent advances in quantum information processing, sensing and communications are surveyed with the objective of identifying the associated knowledge gaps and formulating a roa…
TE-PAI: Exact Time Evolution by Sampling Random Circuits
Chusei Kiumi, Bálint Koczor
Simulating time evolution under quantum Hamiltonians is one of the most natural applications of quantum computers. We introduce TE-PAI, which simulates time evolution exactly by sa…
Preparing Ground and Excited States Using Adiabatic CoVaR
Wooseop Hwang, Bálint Koczor
CoVarince Root finding with classical shadows (CoVaR) was recently introduced as a new paradigm for training variational quantum circuits. Common approaches, such as variants of th…
Low Depth Phase Oracle Using a Parallel Piecewise Circuit
Zhu Sun, Gregory Boyd, Zhenyu Cai +7
We explore the important task of applying a phase to a computational basis state . The closely related task of rotating a target qubit by an angle…
Direct Estimation of the Density of States for Fermionic Systems
Matthew L. Goh, Bálint Koczor
Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. He…
High-Dimensional Subspace Expansion Using Classical Shadows
Gregory Boyd, Bálint Koczor, Zhenyu Cai
We introduce a post-processing technique for classical shadow measurement data that enhances the precision of ground state estimation through high-dimensional subspace expansion; t…
Biased Estimator Channels for Classical Shadows
Zhenyu Cai, Adrian Chapman, Hamza Jnane +1
Extracting classical information from quantum systems is of fundamental importance, and classical shadows allow us to extract a large amount of information using relatively few mea…
Distributed Simulation of Statevectors and Density Matrices
Tyson Jones, Bálint Koczor, Simon C. Benjamin
Classical simulation of quantum computers is an irreplaceable step in the design of quantum algorithms. Exponential simulation costs demand the use of high-performance computing te…
Probabilistic Interpolation of Quantum Rotation Angles
Bálint Koczor, John Morton, Simon Benjamin
Quantum computing requires a universal set of gate operations; regarding gates as rotations, any rotation angle must be possible. However a real device may only be capable of b…
Quantum Error Mitigated Classical Shadows
Hamza Jnane, Jonathan Steinberg, Zhenyu Cai +2
Classical shadows enable us to learn many properties of a quantum state with very few measurements. However, near-term and early fault-tolerant quantum computers will only be a…
Can shallow quantum circuits scramble local noise into global white noise?
Jonathan Foldager, Bálint Koczor
Shallow quantum circuits are believed to be the most promising candidates for achieving early practical quantum advantage - this has motivated the development of a broad range of e…
Algorithmic Shadow Spectroscopy
Hans Hon Sang Chan, Richard Meister, Matthew L. Goh +1
We present shadow spectroscopy as a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubit…
Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
Gregory Boyd, Bálint Koczor
Exploiting near-term quantum computers and achieving practical value is a considerable and exciting challenge. Most prominent candidates as variational algorithms typically aim to…
Multicore Quantum Computing
Hamza Jnane, Brennan Undseth, Zhenyu Cai +2
Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well-spaced but inte…
The Dominant Eigenvector of a Noisy Quantum State
Bálint Koczor
Although near-term quantum devices have no comprehensive solution for correcting errors, numerous techniques have been proposed for achieving practical value. Two works have recent…
Fast computation of spherical phase-space functions of quantum many-body states
Bálint Koczor, Robert Zeier, Steffen J. Glaser
Quantum devices are preparing increasingly more complex entangled quantum states. How can one effectively study these states in light of their increasing dimensions? Phase spaces s…
Quantum Analytic Descent
Bálint Koczor, Simon C. Benjamin
Variational algorithms have particular relevance for near-term quantum computers but require non-trivial parameter optimisations. Here we propose Analytic Descent: Given that the e…
Measurement cost of metric-aware variational quantum algorithms
Barnaby van Straaten, Bálint Koczor
Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability…
Quantum natural gradient generalised to noisy and non-unitary circuits
Bálint Koczor, Simon C. Benjamin
Variational quantum algorithms are promising tools whose efficacy depends on their optimisation method. For noise-free unitary circuits, the quantum generalisation of natural gradi…
Variational-State Quantum Metrology
Bálint Koczor, Suguru Endo, Tyson Jones +2
Quantum technologies exploit entanglement to enhance various tasks beyond their classical limits including computation, communication and measurements. Quantum metrology aims to in…