253 citations · 803 across the 18 of their papers we have counts for
18 papers
Lindblad Multiproduct Formulas
Niall F. Robertson, Andrea D'Urbano, Anton Dekusar +11
We introduce Lindblad Multiproduct Formulas: a quantum error mitigation technique that uses two-dimensional tensor networks contracted with loop-corrected belief propagation. The q…
Preparing 100-qubit symmetry-protected topological order on a digital quantum computer
George Pennington, Kevin C. Smith, James R. Garrison +3
Symmetry-protected topological (SPT) phases extend the Landau paradigm of quantum matter by admitting distinct symmetry-preserving phases that lack any local order parameter. Demon…
Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer
William Kirby, Bibek Pokharel, Javier Robledo Moreno +25
Demonstrating quantum advantage over classical algorithms for ground state energy problems is an outstanding open problem in quantum computation. We experimentally demonstrate that…
Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories
Ali Hamed Moosavian, James R. Garrison, Stephen P. Jordan
Answering whether quantum computers can efficiently simulate quantum field theories has both theoretical and practical motivation. From the theoretical point of view, it answers th…
Entanglement bounds on the performance of quantum computing architectures
Zachary Eldredge, Leo Zhou, Aniruddha Bapat +4
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular…
Circuit Complexity across a Topological Phase Transition
Fangli Liu, Seth Whitsitt, Jonathan B. Curtis +5
We use Nielsen's geometric approach to quantify the circuit complexity in a one-dimensional Kitaev chain across a topological phase transition. We find that the circuit complexitie…