Tanuj Khattar
Research Areas
Authored Publications
Sort By
Expressing and Analyzing Quantum Algorithms with Qualtran
Anurudh Peduri
Charles Yuan
arXiv::2409.04643 (2024)
Preview abstract
Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and chance for error of quantum algorithm development. We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Using carefully chosen abstractions and data structures, we can simulate and test algorithms, automatically generate information-rich diagrams, and tabulate resource requirements. Qualtran offers a \emph{standard library} of algorithmic building blocks that are essential for modern cost-minimizing compilations. Its capabilities are showcased through the re-analysis of key algorithms in Hamiltonian simulation, chemistry, and cryptography. The resulting architecture-independent resource counts can be forwarded to our implementation of cost models to estimate physical costs like wall-clock time and number of physical qubits assuming a surface-code architecture. Qualtran provides a foundation for explicit constructions and reproducible analysis, fostering greater collaboration within the quantum algorithm development community. We believe tools like Qualtran will accelerate progress in the field.
View details
Stable quantum-correlated many-body states through engineered dissipation
Sara Shabani
Dripto Debroy
Jerome Lloyd
Alexios Michailidis
Andrew Dunsworth
Bill Huggins
Markus Hoffmann
Alexis Morvan
Josh Cogan
Ben Curtin
Guifre Vidal
Bob Buckley
Tom O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Sean Harrington
Jeremy Hilton
Paula Heu
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Gina Bortoli
Charles Rocque
Vladimir Shvarts
Alfredo Torres
Anthony Megrant
Charles Neill
Michael Hamilton
Dar Gilboa
Lily Laws
Nicholas Bushnell
Ramis Movassagh
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chik
Leonid Pryadko
Xiao Mi
Brooks Foxen
Frank Arute
Alejo Grajales Dau
Yaxing Zhang
Lara Faoro
Alexander Lill
JiunHow Ng
Justin Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
Amanda Mieszala
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Charina Chou
Paul Conner
Rolando Somma
Vadim Smelyanskiy
Benjamin Chiaro
Grayson Young
Tim Burger
ILYA Drozdov
Agustin Di Paolo
Jimmy Chen
Marika Kieferova
Michael Broughton
Negar Saei
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Ich Nguyen
Yuri Lensky
Roberto Collins
Élie Genois
Jindra Skruzny
Igor Aleiner
Yu Chen
Reza Fatemi
Leon Brill
Ashley Huff
Doug Strain
Monica Hansen
Noah Shutty
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Henry Schurkus
Cheng Xing
Cody Jones
Edward Farhi
Raja Gosula
Andre Petukhov
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
George Sterling
Kostyantyn Kechedzhi
Trond Andersen
Alexandre Bourassa
Kannan Sankaragomathi
Vinicius Ferreira
Science, 383 (2024), pp. 1332-1337
Preview abstract
Engineered dissipative reservoirs have the potential to steer many-body quantum systems toward correlated steady states useful for quantum simulation of high-temperature superconductivity or quantum magnetism. Using up to 49 superconducting qubits, we prepared low-energy states of the transverse-field Ising model through coupling to dissipative auxiliary qubits. In one dimension, we observed long-range quantum correlations and a ground-state fidelity of 0.86 for 18 qubits at the critical point. In two dimensions, we found mutual information that extends beyond nearest neighbors. Lastly, by coupling the system to auxiliaries emulating reservoirs with different chemical potentials, we explored transport in the quantum Heisenberg model. Our results establish engineered dissipation as a scalable alternative to unitary evolution for preparing entangled many-body states on noisy quantum processors.
View details
Quantum Computation of Stopping power for Inertial Fusion Target Design
Andrew Baczewski
Alec White
Dominic Berry
Alina Kononov
Joonho Lee
Proceedings of the National Academy of Sciences, 121 (2024), e2317772121
Preview abstract
Stopping power is the rate at which a material absorbs the kinetic energy of a charged particle passing through it - one of many properties needed over a wide range of thermodynamic conditions in modeling inertial fusion implosions. First-principles stopping calculations are classically challenging because they involve the dynamics of large electronic systems far from equilibrium, with accuracies that are particularly difficult to constrain and assess in the warm-dense conditions preceding ignition. Here, we describe a protocol for using a fault-tolerant quantum computer to calculate stopping power from a first-quantized representation of the electrons and projectile. Our approach builds upon the electronic structure block encodings of Su et al. [PRX Quantum 2, 040332 2021], adapting and optimizing those algorithms to estimate observables of interest from the non-Born-Oppenheimer dynamics of multiple particle species at finite temperature. We also work out the constant factors associated with a novel implementation of a high order Trotter approach to simulating a grid representation of these systems. Ultimately, we report logical qubit requirements and leading-order Toffoli costs for computing the stopping power of various projectile/target combinations relevant to interpreting and designing inertial fusion experiments. We estimate that scientifically interesting and classically intractable stopping power calculations can be quantum simulated with
roughly the same number of logical qubits and about one hundred times more Toffoli gates than is required for state-of-the-art quantum simulations of industrially relevant molecules such as FeMoCo or P450.
View details
Dynamics of magnetization at infinite temperature in a Heisenberg spin chain
Tomaž Prosen
Vedika Khemani
Rhine Samajdar
Jesse Hoke
Sarang Gopalakrishnan
Andrew Dunsworth
Bill Huggins
Markus Hoffmann
Alexis Morvan
Josh Cogan
Ben Curtin
Guifre Vidal
Bob Buckley
Tom O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Sean Harrington
Jeremy Hilton
Paula Heu
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Steven Martin
Gina Bortoli
Seun Omonije
Richard Ross Allen
Charles Rocque
Vladimir Shvarts
Alfredo Torres
Anthony Megrant
Charles Neill
Michael Hamilton
Dar Gilboa
Lily Laws
Nicholas Bushnell
Kyle Anderson
Ramis Movassagh
David Rhodes
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chik
Leonid Pryadko
Xiao Mi
Brooks Foxen
Frank Arute
Alejo Grajales Dau
Yaxing Zhang
Lara Faoro
Alexander Lill
Gordon Hill
JiunHow Ng
Justin Iveland
Marco Szalay
Orion Martin
Juan Campero
Juhwan Yoo
Michael Newman
William Giang
Gonzalo Garcia
Alex Opremcak
Amanda Mieszala
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Rolando Somma
Vadim Smelyanskiy
Benjamin Chiaro
Grayson Young
Tim Burger
ILYA Drozdov
Agustin Di Paolo
Jimmy Chen
Marika Kieferova
Hung-Shen Chang
Michael Broughton
Negar Saei
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Ich Nguyen
Yuri Lensky
Roberto Collins
Élie Genois
Jindra Skruzny
Yu Chen
Reza Fatemi
Leon Brill
Seneca Meeks
Ashley Huff
Doug Strain
Monica Hansen
Noah Shutty
Ebrahim Forati
Doug Thor
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Henry Schurkus
Cheng Xing
Cody Jones
Edward Farhi
Vlad Sivak
Raja Gosula
Andre Petukhov
Clint Earle
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
George Sterling
Trond Andersen
Alexandre Bourassa
Salvatore Mandra
Kannan Sankaragomathi
Vinicius Ferreira
Science, 384 (2024), pp. 48-53
Preview abstract
Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the one-dimensional Heisenberg model were conjectured as to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we studied the probability distribution of the magnetization transferred across the chain’s center, P(M). The first two moments of P(M) show superdiffusive behavior, a hallmark of KPZ universality. However, the third and fourth moments ruled out the KPZ conjecture and allow for evaluating other theories. Our results highlight the importance of studying higher moments in determining dynamic universality classes and provide insights into universal behavior in quantum systems.
View details
Rapid initial state preparation for the quantum simulation of strongly correlated molecules and materials
Seunghoon Lee
Tae In Kim
Yu Tong
Garnet Chan
Lin Lin
Dominic Berry
Alec White
arXiv:2409.11748 (2024)
Preview abstract
Studies on quantum algorithms for ground state energy estimation often assume perfect ground state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here we address that problem in two ways: by faster preparation of matrix product state (MPS) approximations, and more efficient filtering of the prepared state to find the ground state energy. We show how to achieve unitary synthesis with a Toffoli complexity about $7 \times$ lower than that in prior work, and use that to derive a more efficient MPS preparation method. For filtering we present two different approaches: sampling and binary search. For both we use the theory of window functions to avoid large phase errors and minimise the complexity. We find that the binary search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about 0.003. Finally, we estimate the total resources to perform ground state energy estimation of FeMoco and Iron cluster systems by estimating ground state overlap on an MPS initial state through extrapolation. With a modest bond dimension of 4000 we estimate a 0.96 overlap squared value producing total resources of $7.5 \times 10^{10}$ Toffoli gates; validating naive estimates where we assume perfect ground state overlap. These extrapolations allay practical concerns of exponential overlap decay in challenging-to-compute chemical systems.
View details
Purification-Based Quantum Error Mitigation of Pair-Correlated Electron Simulations
Christian Gogolin
Vincent Elfving
Fotios Gkritsis
Oumarou Oumarou
Gian-Luca R. Anselmetti
Masoud Mohseni
Andrew Dunsworth
William J. Huggins
Markus Rudolf Hoffmann
Alexis Morvan
Josh Godfrey Cogan
Ben Curtin
Guifre Vidal
Bob Benjamin Buckley
Trevor Johnathan Mccourt
Thomas E O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Sean Harrington
Jeremy Patterson Hilton
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Richard Ross Allen
Vladimir Shvarts
Alfredo Torres
Stefano Polla
Anthony Megrant
Charles Neill
Michael C. Hamilton
Dar Gilboa
Lily MeeKit Laws
Nicholas Bushnell
Kyle Anderson
Ramis Movassagh
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chun Fung Chik
Xiao Mi
Brooks Riley Foxen
Frank Carlton Arute
Alejandro Grajales Dau
Yaxing Zhang
Lara Faoro
Alexander T. Lill
Jiun How Ng
Justin Thomas Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Rolando Diego Somma
Vadim Smelyanskiy
Benjamin Chiaro
Grayson Robert Young
Tim Burger
Ilya Drozdov
Jimmy Chen
Marika Kieferova
Michael Blythe Broughton
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Nguyen
Daniel Eppens
Roberto Collins
Jindra Skruzny
Igor Aleiner
Yu Chen
Reza Fatemi
Leon Brill
Ashley Anne Huff
Doug Strain
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Cody Jones
Edward Farhi
Andre Gregory Petukhov
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
Kostyantyn Kechedzhi
Trond Ikdahl Andersen
Alexandre Bourassa
Kannan Aryaperumal Sankaragomathi
Nature Physics (2023)
Preview abstract
An important measure of the development of quantum computing platforms has been the simulation of increasingly complex physical systems. Prior to fault-tolerant quantum computing, robust error mitigation strategies are necessary to continue this growth. Here, we study physical simulation within the seniority-zero electron pairing subspace, which affords both a computational stepping stone to a fully correlated model, and an opportunity to validate recently introduced ``purification-based'' error-mitigation strategies. We compare the performance of error mitigation based on doubling quantum resources in time (echo verification) or in space (virtual distillation), on up to 20 qubits of a superconducting qubit quantum processor. We observe a reduction of error by one to two orders of magnitude below less sophisticated techniques (e.g. post-selection); the gain from error mitigation is seen to increase with the system size. Employing these error mitigation strategies enables the implementation of the largest variational algorithm for a correlated chemistry system to-date. Extrapolating performance from these results allows us to estimate minimum requirements for a beyond-classical simulation of electronic structure. We find that, despite the impressive gains from purification-based error mitigation, significant hardware improvements will be required for classically intractable variational chemistry simulations.
View details
Measurement-induced entanglement and teleportation on a noisy quantum processor
Vedika Khemani
Matteo Ippoliti
Andrew Dunsworth
Bill Huggins
Markus Hoffmann
Alexis Morvan
Josh Cogan
Ben Curtin
Guifre Vidal
Bob Buckley
Tom O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Ningfeng Zhu
Shirin Montazeri
Sergei Isakov
Jamie Yao
Clarke Smith
Rebecca Potter
Jeremy Hilton
Paula Heu
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Aaron Shorter
Steve Habegger
Gina Bortoli
Seun Omonije
Charles Rocque
Vladimir Shvarts
Alfredo Torres
Anthony Megrant
Charles Neill
Michael Hamilton
Dar Gilboa
Lily Laws
Nicholas Bushnell
Ramis Movassagh
Mike Shearn
Wojtek Mruczkiewicz
Desmond Chik
Leonid Pryadko
Xiao Mi
Brooks Foxen
Frank Arute
Alejo Grajales Dau
Yaxing Zhang
Alexander Lill
JiunHow Ng
Justin Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
Amanda Mieszala
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Rolando Somma
Vadim Smelyanskiy
Jesse Hoke
Benjamin Chiaro
Grayson Young
Tim Burger
ILYA Drozdov
Agustin Di Paolo
Jimmy Chen
Marika Kieferova
Michael Broughton
Negar Saei
Juan Atalaya
Markus Ansmann
Pavol Juhas
Murray Ich Nguyen
Yuri Lensky
Daniel Eppens
Roberto Collins
Jindra Skruzny
Yu Chen
Reza Fatemi
Leon Brill
Ashley Huff
Doug Strain
Monica Hansen
Noah Shutty
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Henry Schurkus
Cheng Xing
Cody Jones
Edward Farhi
Raja Gosula
Andre Petukhov
Alexander Korotkov
Ani Nersisyan
Christopher Schuster
George Sterling
Kostyantyn Kechedzhi
Trond Andersen
Alexandre Bourassa
Kannan Sankaragomathi
Vinicius Ferreira
Nature, 622 (2023), 481–486
Preview abstract
Measurement has a special role in quantum theory: by collapsing the wavefunction, it can enable phenomena such as teleportation and thereby alter the ‘arrow of time’ that constrains unitary evolution. When integrated in many-body dynamics, measurements can lead to emergent patterns of quantum information in space–time that go beyond the established paradigms for characterizing phases, either in or out of equilibrium. For present-day noisy intermediate-scale quantum (NISQ) processors, the experimental realization of such physics can be problematic because of hardware limitations and the stochastic nature of quantum measurement. Here we address these experimental challenges and study measurement-induced quantum information phases on up to 70 superconducting qubits. By leveraging the interchangeability of space and time, we use a duality mapping to avoid mid-circuit measurement and access different manifestations of the underlying phases, from entanglement scaling to measurement-induced teleportation. We obtain finite-sized signatures of a phase transition with a decoding protocol that correlates the experimental measurement with classical simulation data. The phases display remarkably different sensitivity to noise, and we use this disparity to turn an inherent hardware limitation into a useful diagnostic. Our work demonstrates an approach to realizing measurement-induced physics at scales that are at the limits of current NISQ processors.
View details
Fault-Tolerant Quantum Simulation of Materials Using Bloch Orbitals
Sabrina Sicolo
Alec White
Michael Kuehn
Michael Kaicher
Dominic Berry
Eugene DePrince III
Joonho Lee
PRX Quantum, 4 (2023), pp. 040303
Preview abstract
The simulation of chemistry is among the most promising applications of quantum computing. However, most prior work exploring algorithms for block encoding, time evolving, and sampling in the eigenbasis of electronic structure Hamiltonians has either focused on modeling finite-sized systems, or has required a large number of plane-wave basis functions. In this work, we extend methods for quantum simulation with Bloch orbitals constructed from symmetry-adapted atom-centered orbitals so that one can model periodic ab initio Hamiltonians using only a modest number of basis functions. We focus on adapting existing algorithms based on combining qubitization with tensor factorizations of the Coulomb operator. Significant modifications of those algorithms are required to obtain an asymptotic speedup leveraging translational (or, more broadly, Abelian) symmetries. We implement block encodings using known tensor factorizations and a new Bloch orbital form of tensor hypercontraction. Finally, we estimate the resources required to deploy our algorithms to classically challenging model materials relevant to the chemistry of lithium nickel oxide battery cathodes within the surface code. We find that even with these improvements, the quantum runtime of these algorithms is on the order of thousands of days and further algorithmic improvements are required to make realistic quantum simulation of materials practical.
View details
Noise-resilient Majorana Edge Modes on a Chain of Superconducting Qubits
Zijun Chen
Brooks Foxen
Masoud Mohseni
Emily Mount
Joao Basso
Andrew Dunsworth
William J. Huggins
Yuan Su
Markus Rudolf Hoffmann
Alexis Morvan
Guifre Vidal
Bob Benjamin Buckley
Thomas E O'Brien
John Mark Kreikebaum
Rajeev Acharya
Joonho Lee
Shirin Montazeri
Sergei Isakov
Jamie Yao
Rebecca Potter
Jeremy Patterson Hilton
Alexei Kitaev
Alex Crook
Fedor Kostritsa
Kim Ming Lau
Dmitry Abanin
Trent Huang
Steve Habegger
Alexa Rubinov
Vladimir Shvarts
Anthony Megrant
Charles Neill
Dar Gilboa
Nicholas Bushnell
Mike Shearn
Wojtek Mruczkiewicz
Xiao Mi
Frank Carlton Arute
Alejandro Grajales Dau
Yaxing Zhang
Lara Faoro
Justin Thomas Iveland
Marco Szalay
Orion Martin
Juhwan Yoo
Michael Newman
William Giang
Alex Opremcak
William Courtney
Andrey Klots
Wayne Liu
Pavel Laptev
Paul Conner
Vadim Smelyanskiy
Benjamin Chiaro
Bernardo Meurer Costa
Michael Blythe Broughton
Juan Atalaya
Daniel Eppens
Roberto Collins
Igor Aleiner
Yu Chen
Reza Fatemi
Leon Brill
Ashley Anne Huff
Doug Strain
Ebrahim Forati
Dave Landhuis
Kenny Lee
Ping Yeh
Kunal Arya
Michel Henri Devoret
Cody Jones
Edward Farhi
Andre Gregory Petukhov
Alexander Korotkov
Christopher Schuster
Kostyantyn Kechedzhi
Trond Ikdahl Andersen
Alexandre Bourassa
Kannan Aryaperumal Sankaragomathi
Science (2022) (to appear)
Preview abstract
Inherent symmetry of a quantum system may protect its otherwise fragile states. Leveraging such protection requires testing its robustness against uncontrolled environmental interactions. Using 47 superconducting qubits, we implement the kicked Ising model which exhibits Majorana edge modes (MEMs) protected by a $\mathbb{Z}_2$-symmetry. Remarkably, we find that any multi-qubit Pauli operator overlapping with the MEMs exhibits a uniform decay rate comparable to single-qubit relaxation rates, irrespective of its size or composition. This finding allows us to accurately reconstruct the exponentially localized spatial profiles of the MEMs. Spectroscopic measurements further indicate exponentially suppressed hybridization between the MEMs over larger system sizes, which manifests as a strong resilience against low-frequency noise. Our work elucidates the noise sensitivity of symmetry-protected edge modes in a solid-state environment.
View details
Realizing topologically ordered states on a quantum processor
A. Greene
F. Pollmann
L. Faoro
C. Knapp
B. Pato
Y.-J. Liu
R. Barends
J. Mutus
M. Knap
A. Smith
M. Mohseni
J. Basso
A. Dunsworth
W. J. Huggins
A. R Derk
B. B. Buckley
T. E. O'Brien
S. Montazeri
S. V. Isakov
Z. Yao
S. D. Harrington
J. Hilton
A. Kitaev
F. Kostritsa
T. Huang
V. Shvarts
A. Megrant
C. Neill
N. Bushnell
W. Mruczkiewicz
X. Mi
B. Foxen
F. Arute
M. Szalay
O. Martin
J. Yoo
M. Newman
A. Opremcak
W. Courtney
P. Laptev
V. Smelyanskiy
B. Chiaro
Z. Chen
M. Broughton
J. Atalaya
D. Eppens
R. Collins
I. Aleiner
Y. Chen
D. Strain
D. Landhuis
P. Yeh
K. Arya
N. C. Jones
E. Farhi
A. Petukhov
A. N. Korotkov
K. Kechedzhi
Science, 374 (2021), pp. 1237-1241
Preview abstract
The discovery of topological order has revolutionized the understanding of quantum matter in modern physics and provided the theoretical foundation for many quantum error correcting codes. Realizing topologically ordered states has proven to be extremely challenging in both condensed matter and synthetic quantum systems. Here, we prepare the ground state of the emblematic toric code Hamiltonian using an efficient quantum circuit on a superconducting quantum processor. We measure a topological entanglement entropy of Stopo ≈ −0.95 × ln 2 and simulate anyon interferometry to extract the braiding statistics of the emergent excitations. Furthermore, we investigate key aspects of the surface code, including logical state injection and the decay of the non-local order parameter. Our results illustrate the topological nature of these states and demonstrate their potential for implementing the surface code.
View details
