187 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of BristolGB11 papers
- Virginia TechUS6 papers
- Computercraft (United States)US5 papers
- University of EdinburghGB4 papers
- Freie Universität BerlinDE3 papers
- Lawrence Berkeley National LaboratoryUS3 papers
- University College LondonGB3 papers
- University of CambridgeGB3 papers
- University of Maryland, College ParkUS3 papers
- California Institute of TechnologyUS2 papers
- Helmholtz-Zentrum Berlin für Materialien und EnergieDE2 papers
- Joint Center for Quantum Information and Computer ScienceUS2 papers
28 papers
Experimental demonstration of optimal measurement for unambiguously discriminating asymmetric qudit states
Kang-Min Hu, Min Namkung, Myung-Hyun Sohn +1
Identification of nonorthogonal quantum states without error is crucial for various applications in quantum information technology, as well as the foundations of quantum physics. T…
Fermionic Averaged Circuit Eigenvalue Sampling
Adrian Chapman, Steven T. Flammia
Fermionic averaged circuit eigenvalue sampling (FACES) is a protocol to simultaneously learn the averaged error rates of many fermionic linear optical (FLO) gates simultaneously an…
Ansatz-free Hamiltonian learning with Heisenberg-limited scaling
Hong-Ye Hu, Muzhou Ma, Weiyuan Gong +4
Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamilt…
Extracting the spin excitation spectrum of a fermionic system using a quantum processor
Lucia Vilchez-Estevez, Raul A. Santos, Sabrina Yue Wang +1
Understanding low-energy excitations in fermionic systems is crucial for their characterization. They determine the response of the system to external weak perturbations, its dynam…
Laplace expansions and tree decompositions: A faster polytime algorithm for shallow nearest-neighbour Boson Sampling
Samo Novák, Raúl García-Patrón
In a Boson Sampling quantum optical experiment we send individual photons into an -mode interferometer and we measure the occupation pattern on the output. The statistics of…
Entropy density benchmarking of near-term quantum circuits
Marine Demarty, James Mills, Kenza Hammam +1
Understanding the limitations imposed by noise on current and next-generation quantum devices is a crucial step toward demonstrating practical quantum advantage. In this work, we i…
Boundaries for quantum advantage with single photons and loop-based time-bin interferometers
Samo Novák, David D. Roberts, Alexander Makarovskiy +2
Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-r…
Efficient Quantum Simulation of QCD Jets on the Light Front
Wenyang Qian, Meijian Li, Carlos A. Salgado +1
Quark and gluon jets provide one of the best ways to probe the matter produced in ultrarelativistic high-energy collisions, from cold nuclear matter to hot quark-gluon plasma. In t…
Chasing shadows with Gottesman-Kitaev-Preskill codes
Jonathan Conrad, Jens Eisert, Steven T. Flammia
We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code. Our protocol does not require the…
Fiber Bundle Fault Tolerance of GKP Codes
Ansgar G. Burchards, Steven T. Flammia, Jonathan Conrad
We investigate multi-mode GKP (Gottesman--Kitaev--Preskill) quantum error-correcting codes from a geometric perspective. First, we construct their moduli space as a quotient of gro…
Efficient self-consistent learning of gate set Pauli noise
Senrui Chen, Zhihan Zhang, Liang Jiang +1
Understanding quantum noise is an essential step towards building practical quantum information processing systems. Pauli noise is a useful model that has been widely applied in qu…
Approximating dynamical correlation functions with constant depth quantum circuits
Reinis Irmejs, Raul A. Santos
One of the most important quantities characterizing the microscopic properties of quantum systems are dynamical correlation functions. These correlations are obtained by time-evolv…
How pure can we go with adiabatic state manipulation?
Raul A. Santos, Alex Kamenev, Yuval Gefen
Dissipative systems with decoherence free subspaces, a.k.a. dark spaces (DSs), can be used to protect quantum information. At the same time, dissipation is expected to give rise to…
Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
Mason L. Rhodes, Michael Kreshchuk, Shivesh Pathak
We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2) and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide expl…
Unveiling quantum phase transitions from traps in variational quantum algorithms
Chenfeng Cao, Filippo Maria Gambetta, Ashley Montanaro +1
Understanding quantum phase transitions in physical systems is fundamental to characterize their behavior at low temperatures. Achieving this requires both accessing good approxima…
Efficient and practical Hamiltonian simulation from time-dependent product formulas
Jan Lukas Bosse, Andrew M. Childs, Charles Derby +3
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in t…
Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
Yuri Alexeev, Maximilian Amsler, Paul Baity +124
Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of e…
Testing quantum satisfiability
Ashley Montanaro, Changpeng Shao, Dominic Verdon
Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA_1-complete for k >= 3, and hence likely hard for quantum computers t…
Sketching phase diagrams using low-depth variational quantum algorithms
Jan Lukas Bosse, Raul Santos, Ashley Montanaro
Mapping out phase diagrams of quantum systems using classical simulations can be challenging or intractable due to the computational resources required to simulate even small quant…
Accelerating the variational quantum eigensolver using parallelism
Lana Mineh, Ashley Montanaro
Quantum computers are getting larger and larger, but device fidelities may not be able to keep up with the increase in qubit numbers. One way to make use of a large device that has…
Towards near-term quantum simulation of materials
Laura Clinton, Toby Cubitt, Brian Flynn +6
Simulation of materials is one of the most promising applications of quantum computers. On near-term hardware the crucial constraint on these simulations is circuit depth. Many qua…
Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
Stasja Stanisic, Jan Lukas Bosse, Filippo Maria Gambetta +5
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hub…
Solving the Hubbard model using density matrix embedding theory and the variational quantum eigensolver
Lana Mineh, Ashley Montanaro
Calculating the ground state properties of a Hamiltonian can be mapped to the problem of finding the ground state of a smaller Hamiltonian through the use of embedding methods. The…
Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance
Dong An, Noah Linden, Jin-Peng Liu +3
Inspired by recent progress in quantum algorithms for ordinary and partial differential equations, we study quantum algorithms for stochastic differential equations (SDEs). Firstly…