Related papers: Conservative Quantum Computing
Correcting errors is a vital but expensive component of fault tolerant quantum computation. Standard fault tolerant protocol assumes the implementation of error correction, via syndrome measurements and possible recovery operations, after…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…
Simulating the dynamics of quantum systems is an important application of quantum computers and has seen a variety of implementations on current hardware. We show that by introducing quantum gates implementing unitary transformations…
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition,…
Probabilistic storage and retrieval (PSR) of unitary quantum dynamics is possible with exponentially small failure probability with respect to the number of systems used as a quantum memory [PRL 122, 170502 (2019)]. Here we study…
Quantum states are inherently fragile, making their storage a major concern for many practical applications and experimental tests of quantum mechanics. The field of quantum memories is concerned with how this storage may be achieved,…
Quantum optimal control theory allows to design accurate quantum gates. We employ it to design high-fidelity two-bit gates for Josephson charge qubits in the presence of both leakage and noise. Our protocol considerably increases the…
We show that if an electromagnetic energy pulse with average photon number <n> is used to carry out the same quantum logical operation on a set of N atoms, either simultaneously or sequentially, the overall error probability in the worst…
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum…
We propose a quantum copy-protection system which protects classical information in the form of non-orthogonal quantum states. The decryption of the stored information is not possible in the classical representation and the decryption…
In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit)…
We demonstrate a quantum error correction scheme that protects against accidental measurement, using an encoding where the logical state of a single qubit is encoded into two physical qubits using a non-deterministic photonic CNOT gate. For…
I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear…
Certain quantum codes allow logic operations to be performed on the encoded data, such that a multitude of errors introduced by faulty gates can be corrected. An important class of such operations are {\em transversal}, acting bitwise…
We start by surveying the history of the idea of a fundamental conservation law and briefly examine the role conservation laws play in different classical contexts. In such contexts we find conservation laws to be useful, but often not…
Qubits encoded in a decoherence-free subsystem and realized in exchange-coupled silicon quantum dots are promising candidates for fault-tolerant quantum computing. Benefits of this approach include excellent coherence, low control…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
Transversal encoded gatesets are highly desirable for fault tolerant quantum computing. However, a quantum error correcting code which exactly corrects for local erasure noise and supports a universal set of transversal gates is ruled out…
We re-examine a non-Gaussian quantum error correction code designed to protect optical coherent-state qubits against errors due to an amplitude damping channel. We improve on a previous result [Phys. Rev. A 81, 062344 (2010)] by providing a…