Related papers: Polynomial procedure of avoiding multiqubit errors…
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…
A general theory of quantum error avoiding codes is established, and new light is shed on the relation between quantum error avoiding and correcting codes. Quantum error avoiding codes are found to be a special type of highly degenerate…
Any technology for quantum information processing (QIP) must embody within it quantum bits (qubits) and maintain control of their key quantum properties of superposition and entanglement. Typical QIP schemes envisage an array of physical…
Encoding a qubit in the continuous degrees of freedom of a quantum system, such as bosonic modes, is a powerful alternative to modern quantum error correction (QEC). Among the most prominent bosonic QEC codes, binomial codes provide…
Proposals for near-term experiments in quantum chemistry on quantum computers leverage the ability to target a subset of degrees of freedom containing the essential quantum behavior, sometimes called the active space. This approximation…
By leveraging quantum-mechanical properties like superposition, entanglement, and interference, quantum computing (QC) offers promising solutions for problems that classical computing has not been able to solve efficiently, such as drug…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
A scheme is proposed for protecting quantum states from both independent decoherence and cooperative decoherence. The scheme operates by pairing each qubit (two-state quantum system) with an ancilla qubit and by encoding the states of the…
Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…
Interactions among qubits are essential for performing two-qubit quantum logic operations. However, nature gives us only nearest neighbor interactions in simple and controllable settings. Here we propose a strategy to induce interactions…
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
Molecular simulations are widely regarded as leading candidates to demonstrate quantum advantage--defined as the point at which quantum methods surpass classical approaches in either accuracy or scale. Yet the qubit counts and error rates…
Quantum computers based on superconducting circuits are experiencing a rapid development, aiming at outperforming classical computers in certain useful tasks in the near future. However, the currently available chip fabrication technologies…
Fault-tolerant quantum computers rely on Quantum Error-Correcting Codes (QECCs) to protect information from noise. However, no single error-correcting code supports a fully transversal and therefore fault-tolerant implementation of all…
Quantum amplitude amplification algorithm is an important and basic technique in quantum computing. In this paper, our goal is to study distributed quantum amplitude amplification algorithms, and the main contributions are: (1) A…
Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds…
Current approaches for building quantum computing devices focus on two-level quantum systems which nicely mimic the concept of a classical bit, albeit enhanced with additional quantum properties. However, rather than artificially limiting…
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…