English
Related papers

Related papers: A distillation-teleportation protocol for fault-to…

200 papers

Quantum random access memory (QRAM)--memory which stores classical data but allows queries to be performed in superposition--is required for the implementation of numerous quantum algorithms. While naive implementations of QRAM are highly…

Quantum Physics · Physics 2021-06-08 Connor T. Hann , Gideon Lee , S. M. Girvin , Liang Jiang

Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size…

Quantum devices can process data in a fundamentally different way than classical computers. To leverage this potential, many algorithms require the aid of a quantum Random Access Memory (QRAM), i.e. a module capable of efficiently loading…

Quantum Physics · Physics 2025-03-26 Francesco Cesa , Hannes Bernien , Hannes Pichler

Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…

Quantum Physics · Physics 2023-12-01 Jon Nelson , Gregory Bentsen , Steven T. Flammia , Michael J. Gullans

Quantum random access memory (QRAM) enables efficient classical data access for quantum computers -- a prerequisite for many quantum algorithms to achieve quantum speedup. Despite various proposals, the experimental realization of QRAM…

With the intense interest in small, noisy quantum computing devices comes the push for larger, more accurate -- and hence more useful -- quantum computers. While fully fault-tolerant quantum computers are, in principle, capable of achieving…

Quantum Physics · Physics 2022-04-22 Akshaya Jayashankar , My Duy Hoang Long , Hui Khoon Ng , Prabha Mandayam

Operating on the principles of quantum mechanics, quantum algorithms hold the promise for solving problems that are beyond the reach of the best-available classical algorithms. An integral part of realizing such speedup is the…

Quantum Physics · Physics 2023-10-03 Shifan Xu , Connor T. Hann , Ben Foxman , Steven M. Girvin , Yongshan Ding

Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of quantum systems. Yet, because of the…

Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different…

Quantum Physics · Physics 2026-05-27 Elisa Bäumer Marty

Quantum random access memory (QRAM) is required for numerous quantum algorithms and network architectures. Previous work has shown that the ubiquitous bucket-brigade QRAM is highly resilient to arbitrary local incoherent noise channels…

Quantum Physics · Physics 2024-12-18 Rohan Mehta , Gideon Lee , Liang Jiang

With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…

Quantum Physics · Physics 2021-12-09 Kianna Wan , Soonwon Choi , Isaac H. Kim , Noah Shutty , Patrick Hayden

Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a feed-forward processing of data, enabled by a hybrid of quantum and classical logic. Representing the control structure of such programs can…

In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where…

Quantum Physics · Physics 2025-08-15 Quynh T. Nguyen , Christopher A. Pattison

Giovannetti, Lloyd, and Maccone [Phys. Rev. Lett. 100, 160501] proposed a quantum random access memory (QRAM) architecture to retrieve arbitrary superpositions of $N$ (quantum) memory cells via $O(\log(N))$ quantum switches and $O(\log(N))$…

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…

Quantum Physics · Physics 2020-01-24 Olivia Di Matteo , Vlad Gheorghiu , Michele Mosca

Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…

Quantum Physics · Physics 2025-01-29 Hayata Yamasaki , Masato Koashi

Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…

Quantum Physics · Physics 2025-12-03 Matthias Christandl , Omar Fawzi , Ashutosh Goswami

Quantum Random Access Memory (QRAM) holds the promise of enabling several large scale applications of quantum computers. However, designing fault tolerant QRAMs for large scale applications is still an open problem due to the poor error and…

Quantum Physics · Physics 2025-12-09 Ansh Singal , Kaitlin N. Smith

Quantum error correction protects fragile quantum information by encoding it into a larger quantum system. These extra degrees of freedom enable the detection and correction of errors, but also increase the operational complexity of the…

In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant operations is obtained by error-correcting noisy transformations…

Quantum Physics · Physics 2015-04-22 Guillaume Duclos-Cianci , David Poulin
‹ Prev 1 2 3 10 Next ›