activity
20172026
most citedToward the first quantum simulation with quantum speedup

559 citations · 3.4k across the 35 of their papers we have counts for

collaborators

35 papers

quant-ph2026

Clifford-efficient sparse state preparation for molecular wavefunctions

Yingrong Chen, Nathan A. Baker, Rushi Gong +7

Sparse quantum state preparation concerns an -qubit target state that is a superposition of only computational basis states. Existing approaches exploit this sparsit…

quant-ph2025

Quantum matrix arithmetics with Hamiltonian evolution

Christopher Kang, Yuan Su

The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics -- with…

quant-ph2023★ 2 cited

Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis

Bo Peng, Yuan Su, Daniel Claudino +3

A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic deg…

quant-ph2022★ 31 cited

On the complexity of implementing Trotter steps

Guang Hao Low, Yuan Su, Yu Tong +1

Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter s…

quant-ph2022★ 73 cited

Learning many-body Hamiltonians with Heisenberg-limited scaling

Hsin-Yuan Huang, Yu Tong, Di Fang +1

Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. In this work, we propose the first algorithm to achieve the Heisenberg limit for learning an…

quant-ph2022★ 40 cited

Analyzing Prospects for Quantum Advantage in Topological Data Analysis

Dominic W. Berry, Yuan Su, Casper Gyurik +7

Lloyd et al. were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, ana…

quant-ph2022★ 3 cited

Entanglement area law for 1D gauge theories and bosonic systems

Nilin Abrahamsen, Yu Tong, Ning Bao +2

We prove an entanglement area law for a class of 1D quantum systems involving infinite-dimensional local Hilbert spaces. This class of quantum systems include bosonic models such a…

quant-ph2021★ 51 cited

Efficient quantum computation of molecular forces and other energy gradients

Thomas E. O'Brien, Michael Streif, Nicholas C. Rubin +12

While most work on the quantum simulation of chemistry has focused on computing energy surfaces, a similarly important application requiring subtly different algorithms is the comp…

quant-ph2021

Optimal scaling quantum linear systems solver via discrete adiabatic theorem

Pedro C. S. Costa, Dong An, Yuval R. Sanders +3

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian.…

quant-ph2021★ 17 cited

Quantum computation of molecular structure using data from challenging-to-classically-simulate nuclear magnetic resonance experiments

Thomas E. O'Brien, Lev B. Ioffe, Yuan Su +4

We propose a quantum algorithm for inferring the molecular nuclear spin Hamiltonian from time-resolved measurements of spin-spin correlators, which can be obtained via nuclear magn…

quant-ph2021★ 73 cited

Provably accurate simulation of gauge theories and bosonic systems

Yu Tong, Victor V. Albert, Jarrod R. McClean +2

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamic…

quant-ph2021★ 19 cited

Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian

Sam McArdle, Earl Campbell, Yuan Su

Achieving an accurate description of fermionic systems typically requires considerably many more orbitals than fermions. Previous resource analyses of quantum chemistry simulation…

quant-ph2021★ 120 cited

Fault-Tolerant Quantum Simulations of Chemistry in First Quantization

Yuan Su, Dominic W. Berry, Nathan Wiebe +2

Quantum simulations of chemistry in first quantization offer important advantages over approaches in second quantization including faster convergence to the continuum limit and the…

quant-ph2020★ 60 cited

Nearly tight Trotterization of interacting electrons

Yuan Su, Hsin-Yuan Huang, Earl T. Campbell

We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity o…

cond-mat.str-el2020★ 29 cited

A Sparse Model of Quantum Holography

Shenglong Xu, Leonard Susskind, Yuan Su +1

We study a sparse version of the Sachdev-Ye-Kitaev (SYK) model defined on random hypergraphs constructed either by a random pruning procedure or by randomly sampling regular hyperg…

quant-ph2020★ 2 cited

Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions

Andrew Y. Guo, Abhinav Deshpande, Su-Kuan Chu +6

The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-sca…

quant-ph2020★ 82 cited

Faster Digital Quantum Simulation by Symmetry Protection

Minh C. Tran, Yuan Su, Daniel Carney +1

Simulating the dynamics of quantum systems is an important application of quantum computers and has seen a variety of implementations on current hardware. We show that by introduci…

quant-ph2019★ 41 cited

Destructive Error Interference in Product-Formula Lattice Simulation

Minh C. Tran, Su-Kuan Chu, Yuan Su +2

Quantum computers can efficiently simulate the dynamics of quantum systems. In this paper, we study the cost of digitally simulating the dynamics of several physically relevant sys…

cond-mat.mes-hall2019★ 15 cited

Quantum oscillations and electronic structures in large Chern number semimetal RhSn

Sheng Xu, Liqin Zhou, Huan Wang +5

We report the magnetoresistance, Hall effect, de Haas-van Alphen (dHvA) oscillations and the electronic structures of single crystal RhSn, which is a typical material of CoSi famil…

quant-ph2019★ 486 cited

A Theory of Trotter Error

Andrew M. Childs, Yuan Su, Minh C. Tran +2

The Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort…

cond-mat.mtrl-sci2019★ 15 cited

Interlayer quantum transport in Dirac semimetal BaGa

Sheng Xu, Changhua Bao, Yi-Yan Wang +8

Quantum limit is quite easy to achieve once the band crossing exists exactly at the Fermi level () in topological semimetals. In multilayered Dirac fermion system, the density…

quant-ph2019★ 107 cited

Time-dependent Hamiltonian simulation with -norm scaling

Dominic W. Berry, Andrew M. Childs, Yuan Su +2

The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this qu…

quant-ph2019★ 125 cited

Quantifying the magic of quantum channels

Xin Wang, Mark M. Wilde, Yuan Su

To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by th…

quant-ph2019★ 184 cited

Nearly optimal lattice simulation by product formulas

Andrew M. Childs, Yuan Su

We consider simulating an -qubit Hamiltonian with nearest-neighbor interactions evolving for time on a quantum computer. We show that this simulation has gate complexity $(n…