We derive the effective channel for a logical qubit protected by an arbitrary quantum error-correcting code, and derive the map between channels induced by concatenation. For certain codes in the presence of single-bit Pauli errors, we calculate the exact threshold error probability for perfect fidelity in the infinite concatenation limit. We then use the control theory technique of balanced truncation to find low-order non-asymptotic approximations for the effective channel dynamics.
In quantum error correction, the description of noise channel cannot be completely accurate, and fluctuation always appears in noise channel. It is found that when fluctuation of physical noise channel is considered, the average effective channel is dependent only on the average of physical noise channel, and the average of physical noise channel here plays the role of the independent error model in the previous works. Now, one may conclude that in the independent error model, the results in previous works are also valid for average channel where fluctuation exists. In some typical cases, our …
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting directly on the logical qubit. In this paper we describe a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure. We show that the map for a concatenation of codes is given by the composition of the maps for the constituent codes. This perspective leads to an efficient means for calculating…
In this work, a quantum error correction (QEC) procedure with the concatenated five-qubit code is used to construct a near-perfect effective qubit channel (with a error below $10^{-5}$) from arbitrary noise channels. The exact performance of the QEC is characterized by a Choi matrix, which can be obtained via a simple and explicit protocol. In a noise model with five free parameters, our numerical results indicate that the concatenated five-qubit code is general: To construct a near-perfect effective channel from the noise channels, the necessary size of the concatenated five-qubit code depend…
Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical systems that are candidates for quantum computing possess this property. Here we study the performance of a concatenated error-detection code in a system that permits only nearest-neighbor interactions in one dimension. We make use of a new message-passing scheme that maximizes the number of errors that can be reliably corrected by the code. Our numerical r…
This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed. We use QuRE to estimate the number of qubits, quantum gates, and amount of time needed to factor a 1024-bit number on several candidate quantum technologies that differ in their clock speed and reliability. We make several interesting observations. First, topological quantum error correction requires fewer resources when physical gate error rates are high, w…
We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise entanglement and long-ranged correlations. We illustrate the approach for the enhancement of matrix product states, i.e. 1D tensor networks, where we replace each of the matrices of the original matrix product state with another 1D tensor network. This procedure yields a 2D tensor network, which includes -- already for tensor dimension two -- all states that can…
For a simple model of mutually interacting qubits it is shown how the errors induced by mutual interactions can be eliminated using concatenated coding. The model is solved exactly for arbitrary interaction strength, for two well-known codes, one and two levels deep: this allows one to see under which circumstances error amplitudes add coherently or incoherently. For deeper concatenation, approximate results are derived which make it possible to calculate an approximate ``threshold'' value for the product of interaction strength and free evolution time, below which the failure probability for …
We construct a theory for long-distance quantum communication based on sharing entanglement through a linear chain of $N$ elementary swapping segments of length~$L=Nl$ where $l$ is the length of each elementary swap setup. Entanglement swapping is achieved by linear optics, photon counting and post-selection, and we include effects due to multi-photon sources, transmission loss and detector inefficiencies and dark counts. Specifically we calculate the resultant four-mode state shared by the two parties at the two ends of the chain, and we derive the two-photon coincidence rate expected for thi…
Two recent developments in quantum control, concatenation and optimization of pulse intervals, are combined to yield a strategy to suppress unwanted couplings in quantum systems to high order. Longitudinal relaxation and transverse dephasing can be suppressed so that systems with a small splitting between their energy levels can be kept isolated from their environment. The required number of pulses grows exponentially with the desired order but is only the square root of the number needed if only concatenation is used. An approximate scheme even brings the number down to polynomial growth. The…
The Mollow triplet is a fundamental signature of quantum optics, and has been observed in numerous quantum systems. Although it arises in the 'strong driving' regime of the quantized field, where the atoms undergo coherent oscillations, it can be typically analyzed within the rotating wave approximation. Here we report the first observation of high-order effects in the Mollow triplet structure due to strong driving. In experiments, we explore the regime beyond the rotating wave approximation using concatenated continuous driving that has less stringent requirements on the driving field power. …
Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behaviour of a quantum error-correcting code under general noise, including noisy measurements. This lack of knowledge is largely due to the computational cost of simulating quantum systems large enough to perform nontrivial encodings. In this paper, we develop general methods for incorporating noisy measurement operations into simulations of quantum error-correcting codes and show that measurement errors on readout qubits manifest…
An exactly solvable model for the multi-level system interacting with several reservoirs at zero temperatures is presented. Population decay rates and decoherence rates predicted by exact solution and several approximate master equations, which are widespread in physical literature, are compared. The space of parameters is classified with respect to different inequities between the exact and approximate rates.
We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods are studied and gate counts are compared for some common operations. While each having distinct advantages, we find that exact decompositions have lower gate counts whereas approximate techniques can cover decompositions for all continuous-variable operations but require significant circuit depth for a modest precision.
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topological codes. Our algorithm makes use of two methods inspired from statistical physics: renormalization groups and mean-field approximations. First, the topological code is approximated by a concatenated block code that can be …
We present a comparative analysis of exact and approximate quantum error correction by means of simple unabridged analytical computations. For the sake of clarity, using primitive quantum codes, we study the exact and approximate error correction of the two simplest unital (Pauli errors) and nonunital (non-Pauli errors) noise models, respectively. The similarities and differences between the two scenarios are stressed. In addition, the performances of quantum codes quantified by means of the entanglement fidelity for different recovery schemes are taken into consideration in the approximate ca…
Fault tolerant quantum error correction (QEC) networks are studied by a combination of numerical and approximate analytical treatments. The probability of failure of the recovery operation is calculated for a variety of CSS codes, including large block codes and concatenated codes. Recent insights into the syndrome extraction process, which render the whole process more efficient and more noise-tolerant, are incorporated. The average number of recoveries which can be completed without failure is thus estimated as a function of various parameters. The main parameters are the gate (gamma) and me…
We compare exact and SU(2)-cluster approximate calculation schemes to determine dynamics of the second-harmonic generation model using its reformulation in terms of a polynomial Lie algebra $su_{pd}(2)$ and related spectral representations of the model evolution operator realized in algorithmic forms. It enabled us to implement computer experiments exhibiting a satisfactory accuracy of the cluster approximations in a large range of characteristic model parameters.
The minimum Kullback entropy principle (mKE) is a useful tool to estimate quantum states and operations from incomplete data and prior information. In general, the solution of a mKE problem is analytically challenging and an approximate solution has been proposed and employed in different context. Recently, the form and a way to compute the exact solution for finite dimensional systems has been found, and a question naturally arises on whether the approximate solution could be an effective substitute for the exact solution, and in which regimes this substitution can be performed. Here, we prov…
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis…
Quantum mechanics has enjoyed a multitude of successes since its formulation in the early twentieth century. At the same time, it has generated puzzles that persist to this day. These puzzles have inspired a large literature in physics and philosophy. There are two distinct approaches. One is to assume that quantum theory is exact, but that the interpretive postulates need modification, to eliminate apparent contradictions. The second approach is to assume that quantum mechanics is not exact, but instead is a very accurate approximation to a deeper level theory, which reconciles the determinis…
We develop the concept of a unitary t-design as a means of expressing operationally useful subsets of the stochastic properties of the uniform (Haar) measure on the unitary group U(2^n) on n qubits. In particular, sets of unitaries forming 2-designs have wide applicability to quantum information protocols. We devise an O(n)-size in-place circuit construction for an approximate unitary 2-design. We then show that this can be used to construct an efficient protocol for experimentally characterizing the fidelity of a quantum process on n qubits with quantum circuits of size O(n) without requiring…
We have evaluated excitation energy transfer rates in photosyntetic complexes using the exact HEOM method and various approximate methods frequently used in the literature, namely, the Förster method, the Redfield method, the modified Redfield method and the variational master equation. The rates are evaluated for the case of a simple dimer and a trimer photosynthetic complex, with vibrational environment characterized by the Drude-Lorentz spectral density. Comparing approximate rates to the exact ones, we have confirmed the validity of approximate methods within appropriate limits, however th…
We derive the exact time-evolution for a general quantum system under the influence of pure phase-noise and demonstrate that for a Gaussian initial state of the bath, the exact result can be obtained also within a perturbative time-local master equation approach already in second order of the system-bath coupling strength. We reveal that this equivalence holds if the initial state of the bath can be mapped to a Gaussian phase-space distribution function. Moreover, we discuss the relation to the standard Bloch-Redfield approach.
Exact Maximum Likelihood Decoding beyond Treewidth via Rank-Decomposition Dynamic Programming
Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Science, Mathematics and Technology Cluster, Singapore University of Technology and Design（新加坡科技设计大学科学、数学与技术集群）
Solving the electronic structure problem on a universal-gate quantum computer within the variational quantum eigensolver (VQE) methodology requires constraining the search procedure to a subspace defined by relevant physical symmetries. Ignoring symmetries results in convergence to the lowest eigenstate of the Fock space for the second quantized electronic Hamiltonian. Moreover, this eigenstate can be symmetry broken due to limitations of the wavefunction ansatz. To address this VQE problem, we introduce and assess methods of exact and approximate projection operators to irreducible eigen-subs…
We present the Born-Markov approximated Redfield quantum master equation (RQME) description for an open system of non-interacting particles (bosons or fermions) on an arbitrary lattice of $N$ sites in any dimension and weakly connected to multiple reservoirs at different temperatures and chemical potentials. The RQME can be reduced to the Lindblad equation, of various forms, by making further approximations. By studying the $N=2$ case, we show that RQME gives results which agree with exact analytical results for steady state properties and with exact numerics for time-dependent properties, ove…
Accurate derivatives are important for efficiently locally traversing and converging in quantum optimization landscapes. By deriving analytically exact control derivatives (gradient and Hessian) for unitary control tasks, we show here that the computational feasibility of meeting this accuracy requirement depends on the choice of propagation scheme and problem representation. Even when exact propagation is sufficiently cheap it is, perhaps surprisingly, much more efficient to optimize the (appropriately) approximate propagators: approximations in the dynamics are traded off for significant com…
Approximate QCAs in one dimension using approximate algebras
California Institute of Technology（加州理工学院）；Ludwig-Maximiliations-Universität München（慕尼黑大学）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与技术中心）；CWI（荷兰数学与计算机科学研究中心）
By analyzing an exactly solvable model in the second quantized formulation which allows a unified treatment of adiabatic and non-adiabatic geometric phases, it is shown that the topology of the adiabatic Berry's phase, which is characterized by the singularity associated with possible level crossing, is trivial in a precise sense. This topology of the geometric phase is quite different from the topology of the Aharonov-Bohm effect, where the topology is specified by the external local gauge field and it is exact for the slow as well as for the fast motion of the electron.
We show that the dynamics of interacting fermions can be exactly replaced by a quantum jump theory in the many-body density matrix space. In this theory, jumps occur between densities formed of pairs of Slater determinants, $D_{ab}=| Φ_a > < Φ_b |$, where each state evolves according to the Stochastic Schrödinger Equation (SSE) given in ref. \cite{Jul02}. A stochastic Liouville-von Neumann equation is derived as well as the associated Bogolyubov-Born-Green-Kirwood-Yvon (BBGKY) hierarchy. Due to the specific form of the many-body density along the path, the presented theory is equivalent to a s…
