1.5k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Harvard UniversityUS8 papers
- University of TorontoCA8 papers
- Massachusetts Institute of TechnologyUS7 papers
- Canadian Institute for Advanced ResearchCA5 papers
- Vector InstituteCA5 papers
- Agency for Science, Technology and ResearchSG4 papers
- Institute of High Performance ComputingSG4 papers
- Ames Research CenterUS3 papers
- Pacific Northwest National LaboratoryUS3 papers
- Rigetti Computing (United States)US3 papers
- The University of Texas at AustinUS3 papers
- University College LondonGB3 papers
46 papers
Variational decision diagrams for quantum-inspired machine learning applications
Vladimir Vargas-Calderón, Santiago Acevedo-Mancera, Herbert Vinck-Posada
Decision diagrams (DDs) have emerged as an efficient tool for simulating quantum circuits due to their capacity to exploit data redundancies in quantum states and quantum operation…
Feasibility of accelerating homogeneous catalyst discovery with fault-tolerant quantum computers
Nicole Bellonzi, Alexander Kunitsa, Joshua T. Cantin +16
The industrial manufacturing of chemicals consumes a significant amount of energy and raw materials. In principle, the development of new catalysts could greatly improve the effici…
Superconducting qubits in the millions: the potential and limitations of modularity
S. N. Saadatmand, Tyler L. Wilson, Mark J. Hodson +11
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, wh…
Cons-training Tensor Networks: Embedding and Optimization Over Discrete Linear Constraints
Javier Lopez-Piqueres, Jing Chen
In this study, we introduce a novel family of tensor networks, termed constrained matrix product states (MPS), designed to incorporate exactly arbitrary discrete linear constraints…
Early Fault-Tolerant Quantum Computing
Amara Katabarwa, Katerina Gratsea, Athena Caesura +1
Over the past decade, research in quantum computing has tended to fall into one of two camps: near-term intermediate scale quantum (NISQ) and fault-tolerant quantum computing (FTQC…
Modeling the Performance of Early Fault-Tolerant Quantum Algorithms
Qiyao Liang, Yiqing Zhou, Archismita Dalal +1
Progress in fault-tolerant quantum computation (FTQC) has driven the pursuit of practical applications with early fault-tolerant quantum computers (EFTQC). These devices, limited i…
Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
Guoming Wang, Daniel Stilck França, Gumaro Rendon +1
A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's qua…
Ionization Potentials of First-Row Transition Metal Aqua Ions
Daniel Mejia-Rodriguez, Alexander A. Kunitsa, Edoardo Aprà +1
We report computations of the vertical ionization potentials within the approximation of the near-complete series of first-row transition metal (V-Cu) aqua ions in their most…
Matrix Product Study of Spin Fractionalization in the 1D Kondo Insulator
Jing Chen, E. Miles Stoudenmire, Yashar Komijani +1
The Kondo lattice is one of the classic examples of strongly correlated electronic systems. We conduct a controlled study of the Kondo lattice in one dimension, highlighting the ro…
Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
Gumaro Rendon, Jacob Watkins, Nathan Wiebe
Quantum metrology allows for measuring properties of a quantum system at the optimal Heisenberg limit. However, when the relevant quantum states are prepared using digital Hamilton…
Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization
Javier Lopez-Piqueres, Jing Chen, Alejandro Perdomo-Ortiz
Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence…
Exploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry
Po-Yu Kao, Ya-Chu Yang, Wei-Yin Chiang +8
De novo drug design with desired biological activities is crucial for developing novel therapeutics for patients. The drug development process is time and resource-consuming, and i…
On proving the robustness of algorithms for early fault-tolerant quantum computers
Rutuja Kshirsagar, Amara Katabarwa, Peter D. Johnson
The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap…
Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
Guoming Wang, Daniel Stilck França, Ruizhe Zhang +2
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding…
Noise tailoring for Robust Amplitude Estimation
Archismita Dalal, Amara Katabarwa
A universal fault-tolerant quantum computer holds the promise to speed up computational problems that are otherwise intractable on classical computers; however, for the next decade…
Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
Manuel S. Rudolph, Jacob Miller, Danial Motlagh +3
While recent breakthroughs have proven the ability of noisy intermediate-scale quantum (NISQ) devices to achieve quantum advantage in classically-intractable sampling tasks, the us…
Neural network enhanced measurement efficiency for molecular groundstates
Dmitri Iouchtchenko, Jérôme F. Gonthier, Alejandro Perdomo-Ortiz +1
It is believed that one of the first useful applications for a quantum computer will be the preparation of groundstates of molecular Hamiltonians. A crucial task involving state pr…
Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods
Phillip W. K. Jensen, Peter D. Johnson, Alexander A. Kunitsa
Determining the properties of molecules and materials is one of the premier applications of quantum computing. A major question in the field is: how might we use imperfect near-ter…
On the basis set selection for molecular core-level calculations
Daniel Mejia-Rodriguez, Alexander Kunitsa, Edoardo Aprà +1
The approximation has been recently gaining popularity among the method for simulating molecular core-level X-ray photoemission spectra. Traditionally, core-level binding…
State Preparation Boosters for Early Fault-Tolerant Quantum Computation
Guoming Wang, Sukin Sim, Peter D. Johnson
Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant…
Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
Ruizhe Zhang, Guoming Wang, Peter Johnson
Significant effort in applied quantum computing has been devoted to the problem of ground state energy estimation for molecules and materials. Yet, for many applications of practic…
Connecting geometry and performance of two-qubit parameterized quantum circuits
Amara Katabarwa, Sukin Sim, Dax Enshan Koh +1
Parameterized quantum circuits (PQCs) are a central component of many variational quantum algorithms, yet there is a lack of understanding of how their parameterization impacts alg…
Quantum algorithm for credit valuation adjustments
Javier Alcazar, Andrea Cadarso, Amara Katabarwa +4
Quantum mechanics is well known to accelerate statistical sampling processes over classical techniques. In quantitative finance, statistical samplings arise broadly in many use cas…
Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
Amir H. Karamlou, William A. Simon, Amara Katabarwa +3
In the near-term, hybrid quantum-classical algorithms hold great potential for outperforming classical approaches. Understanding how these two computing paradigms work in tandem is…