Fast digital methods for adiabatic state preparation
We present quantum algorithms for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. This constitutes an exponential improvement over existing methods, which achieve subpolynomial error dependence.
Author: Wan et al. - Published: Apr 08, 2020
All authors: Kianna Wan, Isaac Kim
Exponentially faster implementations of Select(H) for fermionic Hamiltonians
We present a simple but general framework for constructing quantum circuits that implement the multiply-controlled unitary Select(H)≡∑ℓ|ℓ⟩⟨ℓ|⊗Hℓ, where H=∑ℓHℓ is the Jordan-Wigner transform of an arbitrary second-quantised fermionic Hamiltonian.
Author: Kianna Wan - Published: Apr 08, 2020
A Jordan-Wigner gadget that reduces T count by more than 6x for quantum chemistry applications
Quantum computers have the potential to be a profoundly transformative technology, particularly in the context of quantum chemistry. However, running a chemistry application that is demonstrably useful currently requires a prohibitive number of logical operations.
Author: Sam Pallister - Published: Apr 10, 2020
Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules (arXiv.org)
In this article, we estimate the cost of simulating electrolyte molecules in Li-ion batteries on a fault-tolerant quantum computer, focusing on the molecules that can provide practical solutions to industrially relevant problems.
Author: Kim et al. - Published: Apr 21, 2021
All authors: Isaac H. Kim, Eunseok Lee, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts
Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules (PRR)
In this Physical Review Research (PRR) peer-reviewed technical paper we estimate the resources required in the fusion-based quantum computing scheme to simulate electrolyte molecules in Li-ion batteries on a fault-tolerant, photonic quantum computer.
Author: Kim et al. - Published: Apr 07, 2022
All authors: Isaac H. Kim, Ye-Hua Liu, Sam Pallister, William Pol, Sam Roberts, Eunseok Lee
From three-photon Greenberger-Horne-Zeilinger states to ballistic universal quantum computation
Physical review letters 115 (2), 020502, 2015
M Gimeno-Segovia, P Shadbolt, DE Browne, T Rudolph
Read More
Loss-tolerant teleportation on large stabilizer states
Quantum Science and Technology 4 (2), 025014, 2019
S Morley-Short, M Gimeno-Segovia, T Rudolph, H Cable
Read More
Creation of entangled photonic states using linear optics
arXiv preprint arXiv:2106.13825, 2021
S Bartolucci, PM Birchall, M Gimeno-Segovia, E Johnston, K Kieling, ...
Read More
Interleaving: Modular architectures for fault-tolerant photonic quantum computing
arXiv preprint arXiv:2103.08612, 2021
H Bombin, IH Kim, D Litinski, N Nickerson, M Pant, F Pastawski, S Roberts, ...
Read More
From three-photon Greenberger-Horne-Zeilinger states to ballistic universal quantum computation
Physical review letters 115 (2), 020502, 2015
M Gimeno-Segovia, P Shadbolt, DE Browne, T Rudolph
Read More
Increasing error tolerance in quantum computers with dynamic bias arrangement
Many quantum operations are expected to exhibit bias in the structure of their errors. Recent works have shown that a fixed bias can be exploited to improve error tolerance by statically arranging the errors in beneficial configurations….
Modular decoding: parallelizable real-time decoding for quantum computers
Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
Logical blocks for fault-tolerant topological quantum computation
Logical gates constitute the building blocks of fault-tolerant quantum computation. While quantum error-corrected memories have been extensively studied in the literature, explicit constructions and detailed analyses of thresholds and resource overheads of universal logical gate sets have so far been limited….
Fusion-based quantum computation
We introduce fusion-based quantum computing (FBQC) - a model of universal quantum computation in which entangling measurements, called fusions, are performed on the qubits of small constant-sized entangled resource states…