Quantum computer systems for scientific discovery
The great promise of quantum computers comes with the dual challenges of building them
and finding their useful applications. We argue that these two challenges should be …
and finding their useful applications. We argue that these two challenges should be …
Programmable quantum simulations of spin systems with trapped ions
Laser-cooled and trapped atomic ions form an ideal standard for the simulation of interacting
quantum spin models. Effective spins are represented by appropriate internal energy levels …
quantum spin models. Effective spins are represented by appropriate internal energy levels …
Mixed-state entanglement from local randomized measurements
We propose a method for detecting bipartite entanglement in a many-body mixed state
based on estimating moments of the partially transposed density matrix. The estimates are …
based on estimating moments of the partially transposed density matrix. The estimates are …
Probing Rényi entanglement entropy via randomized measurements
Entanglement is a key feature of many-body quantum systems. Measuring the entropy of
different partitions of a quantum system provides a way to probe its entanglement structure …
different partitions of a quantum system provides a way to probe its entanglement structure …
Benchmarking highly entangled states on a 60-atom analogue quantum simulator
Quantum systems have entered a competitive regime in which classical computers must
make approximations to represent highly entangled quantum states,. However, in this …
make approximations to represent highly entangled quantum states,. However, in this …
Postselection-free entanglement dynamics via spacetime duality
M Ippoliti, V Khemani - Physical Review Letters, 2021 - APS
The dynamics of entanglement in “hybrid” nonunitary circuits (for example, involving both
unitary gates and quantum measurements) has recently become an object of intense study …
unitary gates and quantum measurements) has recently become an object of intense study …
Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems
is a prominent target for quantum computers. However, accurately representing the Fermi …
is a prominent target for quantum computers. However, accurately representing the Fermi …
Noise resilience of variational quantum compiling
Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that
leverage classical optimization to minimize a cost function, which is efficiently evaluated on …
leverage classical optimization to minimize a cost function, which is efficiently evaluated on …
Learning the quantum algorithm for state overlap
Short-depth algorithms are crucial for reducing computational error on near-term quantum
computers, for which decoherence and gate infidelity remain important issues. Here we …
computers, for which decoherence and gate infidelity remain important issues. Here we …
Variational fast forwarding for quantum simulation beyond the coherence time
Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to
simulation times less than the coherence time of the quantum computer (QC), which limits …
simulation times less than the coherence time of the quantum computer (QC), which limits …