Related papers: Quantum error correction via multi-particle discre…
We use density matrix simulations to study the performance of three distance three quantum error correcting codes in the context of the rare-earth-ion-doped crystal (RE) platform for quantum computing. We analyze pseudothresholds for these…
We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an…
In distributed quantum computing, the final solution of a problem is usually achieved by catenating these partial solutions resulted from different computing nodes, but intolerable errors likely yield in this catenation process. In this…
Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color code and surface code schemes, must devote a large fraction…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
Quantum error correction is capable of digitizing quantum noise and increasing the robustness of qubits. Typically, error correction is designed with the target of eliminating all errors - making an error so unlikely it can be assumed that…
A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome…
Quantum walks of interacting particles may display non-trivial features due to the interplay between the statistical nature and the many-body interactions associated to them. We analyze the quantum walk of interacting defects on top of an…
We implement a quantum walk in phase space with a new mechanism based on the superconducting resonator-assisted double quantum dots. By analyzing the hybrid system, we obtain the necessary factors of realization of a quantum walk in phase…
Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…
We show that a quantum state transfer, previously studied as a continuous time process in networks of interacting spins, can be achieved within the model of discrete time quantum walks with position dependent coin. We argue that due to…
We introduce a two-step error correction scheme for reconciliation in continuous-variable quantum key distribution systems. Using this scheme, it is possible to use error correction codes with small blocklengths (1000 bits), increasing…
Quantum error correction, which utilizes logical qubits that are encoded as redundant multiple physical qubits to find and correct errors in physical qubits, is indispensable for practical quantum computing. Surface code is considered to be…
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…
We address multi-parameter quantum estimation for one-dimensional discrete-time quantum walks and its applications to quantum metrology. We use the quantum walker as a probe for unknown parameters encoded on its coin degrees of freedom. We…
We develop a measurement-based protocol for simultaneously purifying arbitrary logical states in multiple quantum error correcting codes with unit fidelity and finite probability, starting from arbitrary thermal states of each code. The…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm…
We describe a protocol for continuously protecting unknown quantum states from decoherence that incorporates design principles from both quantum error correction and quantum feedback control. Our protocol uses continuous measurements and…
We demonstrate a platform for implementing quantum walks that overcomes many of the barriers associated with photonic implementations. We use coupled fiber-optic cavities to implement time-bin encoded walks in an integrated system. We show…