Related papers: Active volume: An architecture for efficient fault…
A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this…
As quantum photonic hardware scales toward computationally relevant sizes, energy consumption has emerged as a key constraint. Programmable photonic integrated circuits, composed of interferometer meshes with tunable phase modulators,…
A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=\lceil \log_2N\rceil$-qubit state. It has been proven that any algorithm universally implementing this…
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'' error correction may be decades away. In the meantime, we…
Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a…
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation…
We found that the actual computational time-cost of the QFT is O(n 2^n) for large n in a quantum computer using nuclear spins. The computational cost of a quantum algorithm has usually been estimated as the sum of the universal gates…
There are well-known protocols for performing CNOT quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures being considered for quantum computation involve qubits or…
We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the ``clock speed'' of the quantum computer. The…
Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction for large-scale processing. However, the overhead in the realization of error-corrected ``logical'' qubits, where information is…
Holistic resource estimates are essential for guiding the development of fault-tolerant quantum algorithms and the computers they will run on. This is particularly true when we focus on highly-constrained early fault-tolerant devices. Many…
It is well understood that a two-dimensional grid of locally-interacting qubits is a promising platform for achieving fault tolerant quantum computing. However in the near-future, it may prove less challenging to develop lower dimensional…
These notes present a review of the status of quantum computing with arrays of neutral atom qubits, an approach which has demonstrated remarkable progress in the last few years. Scaling digital quantum computing to qubit counts and control…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
We propose a method for implementation of a quantum computer using artificial molecules. The artificial molecule consists of two coupled quantum dots stacked along z direction and one single electron. One-qubit and two-qubit gates are…
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…
Quantum computing promises revolutionary advances in modeling materials and molecules. However, the up-to-date runtime estimates for utility-scale applications on certain quantum hardware systems are in the order of years rendering quantum…
Current experiments are taking the first steps toward noise-resilient logical qubits. Crucially, a quantum computer must not merely store information, but also process it. A fault-tolerant computational procedure ensures that errors do not…
Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear…
Standard approaches to quantum computing require significant overhead to correct for errors. The hardware size for conventional quantum processors in solids often increases linearly with the number of physical qubits, such as for transmon…