170 citations · 288 across the 12 of their papers we have counts for
5 papers · 1 filter
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
Bryce Fuller, Charles Hadfield, Jennifer R. Glick +8
Combinatorial problems are formulated to find optimal designs within a fixed set of constraints. They are commonly found across diverse engineering and scientific domains. Understa…
Second-quantized fermionic operators with polylogarithmic qubit and gate complexity
William Kirby, Bryce Fuller, Charles Hadfield +1
We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved, as in the electronic structure problem. When the number …
Adaptive Pauli Shadows for Energy Estimation
Charles Hadfield
Locally-biased classical shadows allow rapid estimation of energies of quantum Hamiltonians. Recently, derandomised classical shadows have emerged claiming to be even more accurate…
Decision Diagrams for Quantum Measurements with Shallow Circuits
Stefan Hillmich, Charles Hadfield, Rudy Raymond +2
We consider the problem of estimating quantum observables on a collection of qubits, given as a linear combination of Pauli operators, with shallow quantum circuits consisting of s…
Doubling the size of quantum simulators by entanglement forging
Andrew Eddins, Mario Motta, Tanvi P. Gujarati +4
Quantum computers are promising for simulations of chemical and physical systems, but the limited capabilities of today's quantum processors permit only small, and often approximat…