相关论文: Improved T counts and active volume estimates for …
Silicon-based quantum computing has the potential advantages of low cost, high integration density, and compatibility with CMOS technologies. The detuning mechanism has been used to experimentally achieve silicon two-qubit quantum gates and…
While the accuracy of qubit operations has been greatly improved in the last decade, further development is demanded to achieve the ultimate goal: a fault-tolerant quantum computer that can solve real-world problems more efficiently than…
Qubit shuttling promises to advance some quantum computing platforms to the qubit register sizes needed for effective quantum error correction (QEC), but also introduces additional errors whose impact must be evaluated. The established…
Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is…
Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the…
Present-day quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors-all of which obstruct the execution of large and complex circuits. The advancement of…
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…
Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a…
The most common error models for quantum computers assume the independence of errors on different qubits. However, most noise mechanisms have some correlations in space. We show how to improve quantum information processing for few-qubit…
The logical S gate implemented via twist defect braiding in the surface code is one of the major sources of overhead in fault-tolerant quantum computing, since an S-gate correction is required in every logical T-gate teleportation. Existing…
Distributed computing, in which a resource-intensive task is divided into subtasks and distributed among different machines, plays a key role in solving large-scale problems. Coded computing is a recently emerging paradigm where redundancy…
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
The design space of current quantum computers is expansive with no obvious winning solution. This leaves practitioners with a clear question: "What is the optimal system configuration to run an algorithm?". This paper explores hardware…
Characterizing and mitigating errors in current noisy intermediate-scale devices is important to improve performance of next generations of quantum hardware. In order to investigate the importance of the different noise mechanisms affecting…
Electronic structure calculations of molecular systems are among the most promising applications for fault-tolerant quantum computing (FTQC) in quantum chemistry and drug design. However, while recent algorithmic advancements such as…
As quantum computers of non-trivial size become available in the near future, it is imperative to develop tools to emulate small quantum computers. This allows for validation and debugging of algorithms as well as exploring…
Using the subdynamical kinetic equation for an open quantum system, a formulation is presented for performing decoherence-free (DF) quantum computing in Rigged Liouville Space (RLS). Three types of interactions were considered, and in each…
In this paper, we introduce a technique for contracting (i.e. numerically evaluating) ZX-diagrams whose complexity scales with their rank-width, a graph parameter that behaves nicely under ZX rewrite rules. Given a rank-decomposition of…
Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an…