相关论文: Purifying Quantum States: Quantum and Classical Al…
We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces -- composite permutation-invariant spaces of many qubits or qudits, composite constant-excitation Fock-state spaces of many…
Variational quantum algorithms (VQAs) are prominent candidates for near-term quantum advantage but lack rigorous guarantees of convergence and generalization. By contrast, quantum phase estimation (QPE) provides provable performance under…
In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space-time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to…
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding…
Quantum many-body systems are characterized by patterns of correlations that define highly-non trivial manifolds when interpreted as data structures. Physical properties of phases and phase transitions are typically retrieved via simple…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
Due to its potential for implementing a scalable quantum computer, multiqubit Toffoli gate lies in the heart of quantum information processing. In this article, we demonstrate a multiqubit blockade gate with atoms arranged in a…
We report the implementation of universal two- and three-qubit entangling gates on neutral atom qubits encoded in long-lived hyperfine ground states. The gates are mediated by excitation to strongly interacting Rydberg states, and are…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
The construction of two-qubit gates appropriate for universal quantum computation is of enormous importance to quantum information processing. Building such gates is dependent on accurate knowledge of the interaction dynamics between two…
Reversible computation has been proposed as a future paradigm for energy efficient computation, but so far few implementations have been realised in practice. Quantum circuits, running on quantum computers, are one construct known to be…
Computing many-body ground state energies and resolving electronic structure calculations are fundamental problems for fields such as quantum chemistry or condensed matter. Several quantum computing algorithms that address these problems…
An efficient Path Integral Monte Carlo procedure is proposed to simulate the behavior of quantum many-body dissipative systems described within the framework of the influence functional. Thermodynamic observables are obtained by Monte Carlo…
The performance of quantum error correction schemes depends sensitively on the physical realizations of the qubits and the implementations of various operations. For example, in quantum dot spin qubits, readout is typically much slower than…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
't Hooft's derivation of quantum from classical physics is analyzed by means of the classical path integral of Gozzi et al.. It is shown how the key element of this procedure - the loss of information constraint - can be implemented by…