相关论文: Suboptimal quantum-error-correcting procedure base…
We investigate the problem of determining the parameters that describe a quantum channel. It is assumed that the users of the channel have at best only partial knowledge of it and make use of a finite amount of resources to estimate it. We…
We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum…
The essence of quantum error-correction is to use redundant Hilbert space to identify and correct errors, and the channel fidelity of the quantum channel does not affect which errors can be identified and corrected. Based on this, it is…
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…
Quantum cryptography via key distribution mechanisms that utilize quantum entanglement between sender-receiver pairs will form the basis of future large-scale quantum networks. A key engineering challenge in such networks will be the…
We propose an estimation method for quantum measurement tomography (QMT) based on semidefinite programming (SDP), and discuss how it may be employed to detect experimental imperfections, such as shot noise and/or faulty preparation of the…
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes…
Channel simulation using coherence, which refers to realizing a target channel with coherent states and free operations, is a fundamental problem in the quantum resource theory of coherence. The limitations of the accuracy of deterministic…
We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This…
Quantum error correction protects the quantum state against noise and decoherence in quantum communication and quantum computation, which enables one to perform fault-torrent quantum information processing. We experimentally demonstrate a…
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one…
An efficient coding circuit is given for the perfect quantum error correction of a single qubit against arbitrary 1-qubit errors within a 5 qubit code. The circuit presented employs a double `classical' code, i.e., one for bit flips and one…
In this introduction we motivate and explain the ``decoding'' and ``subsystems'' view of quantum error correction. We explain how quantum noise in QIP can be described and classified, and summarize the requirements that need to be satisfied…
The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction…
Contrary to the assumption that most quantum error-correcting codes (QECC) make, it is expected that phase errors are much more likely than bit errors in physical devices. By employing the entanglement-assisted stabilizer formalism, we…
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…
In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs). We incorporate penalty terms into the objective of convex relaxations in order to retrieve…