7k citations
- University of California, Santa BarbaraUS109 papers
- Microsoft Research (United Kingdom)GB50 papers
- ETH ZurichCH46 papers
- University of California, BerkeleyUS45 papers
- University of Maryland, College ParkUS43 papers
- Carnegie Mellon UniversityUS41 papers
- Stanford UniversityUS39 papers
- University of WashingtonUS37 papers
- Cornell UniversityUS32 papers
- Princeton UniversityUS32 papers
- California Institute of TechnologyUS28 papers
- Microsoft Research New York City (United States)25 papers
7 papers · 2 filters
Connecting Entanglement in Time and Space: Improving the Folding Algorithm
M. B. Hastings, R. Mahajan
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the compu…
Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
Ryan Babbush, Jarrod McClean, Dave Wecker +2
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorith…
Efficient synthesis of probabilistic quantum circuits with fallback
Alex Bocharov, Martin Roetteler, Krysta M. Svore
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of gates of about of what is requ…
Quantum Bootstrapping via Compressed Quantum Hamiltonian Learning
Nathan Wiebe, Christopher Granade, David G. Cory
Recent work has shown that quantum simulation is a valuable tool for learning empirical models for quantum systems. We build upon these results by showing that a small quantum simu…
Low-distance Surface Codes under Realistic Quantum Noise
Yu Tomita, Krysta M. Svore
We study the performance of distance-three surface code layouts under realistic multi-parameter noise models. We first calculate their thresholds under depolarizing noise. We then…
Efficient synthesis of universal Repeat-Until-Success circuits
Alex Bocharov, Martin Roetteler, Krysta M. Svore
Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a times reduction in expected -count over ancilla-free techniques for single-qubit unitary deco…