In the era of noisy intermediate-scale quantum (NISQ) devices, the number of controllable hardware qubits is insufficient to implement quantum error correction (QEC). As an alternative, quantum error mitigation (QEM) can suppress errors in measurement results via repeated experiments and postprocessing of data. Typical techniques for error mitigation, e.g., the quasi-probability decomposition method, ignore correlated errors between different gates. Here, we introduce a QEM method based on the matrix product operator (MPO) representation of a quantum circuit that can characterize the noise channel with polynomial complexity. Our technique is demonstrated on a $\rm{depth}=20$ fully parallel quantum circuit of up to $N_q=20$ qubits undergoing local and global noise. The circuit error is reduced by several times with only a small bond dimension $D^{\prime} = 1$ for the noise channel. The MPO representation increases the accuracy of modeling noise without consuming more experimental resources, which improves the QEM performance and broadens its scope of application. Our method is hopeful of being applied to circuits in higher dimensions with more qubits and deeper depth.
Probing the Error-Mitigation Threshold with Matrix Product States
Joint Quantum Institute and Joint Center for Quantum Information and Computer Science, University of Maryland(马里兰大学联合量子研究所与联合量子信息与计算科学中心);National Institute of Standards and Technology(美国国家标准与技术研究院)
The relation between the thermodynamic entropy production and non-Markovian evolutions is matter of current research. Here, we study the behavior of the stochastic entropy production in open quantum systems undergoing unital non-Markovian dynamics. In particular, for the family of Pauli channels we show that in some specific time intervals both the average entropy production and the variance can decrease, provided that the quantum dynamics fails to be P-divisible. Although the dynamics of the system is overall irreversible, our result may be interpreted as a transient tendency towards reversib…
We present a method for mitigating measurement errors on quantum computing platforms that does not form the full assignment matrix, or its inverse, and works in a subspace defined by the noisy input bit-strings. This method accommodates both uncorrelated and correlated errors, and allows for computing accurate error bounds. Additionally, we detail a matrix-free preconditioned iterative solution method that converges in $\mathcal{O}(1)$ steps that is performant and uses orders of magnitude less memory than direct factorization. We demonstrate the validity of our method, and mitigate errors in a…
Variational quantum eigensolvers offer a small-scale testbed to demonstrate the performance of error mitigation techniques with low experimental overhead. We present successful error mitigation by applying the recently proposed symmetry verification technique to the experimental estimation of the ground-state energy and ground state of the hydrogen molecule. A finely adjustable exchange interaction between two qubits in a circuit QED processor efficiently prepares variational ansatz states in the single-excitation subspace respecting the parity symmetry of the qubit-mapped Hamiltonian. Symmetr…
We investigate the performance of error mitigation via measurement of conserved symmetries on near-term devices. We present two protocols to measure conserved symmetries during the bulk of an experiment, and develop a zero-cost post-processing protocol which is equivalent to a variant of the quantum subspace expansion. We develop methods for inserting global and local symetries into quantum algorithms, and for adjusting natural symmetries of the problem to boost their mitigation against different error channels. We demonstrate these techniques on two- and four-qubit simulations of the hydrogen…
Noise in existing quantum processors only enables an approximation to ideal quantum computation. However, these approximations can be vastly improved by error mitigation, for the computation of expectation values, as shown by small-scale experimental demonstrations. However, the practical scaling of these methods to larger system sizes remains unknown. Here, we demonstrate the utility of zero-noise extrapolation for relevant quantum circuits using up to 26 qubits, circuit depths of 60, and 1080 CNOT gates. We study the scaling of the method for canonical examples of product states and entangli…
Several techniques have been recently introduced to mitigate errors in near-term quantum computers without the overhead required by quantum error correcting codes. While most of the focus has been on gate errors, measurement errors are significantly larger than gate errors on some platforms. A widely used {\it transition matrix error mitigation} (TMEM) technique uses measured transition probabilities between initial and final classical states to correct subsequently measured data. However from a rigorous perspective, the noisy measurement should be calibrated with perfectly prepared initial st…
Calculating the trace of the product of $m$ $n$-qubit density matrices (multivariate trace) is a crucial subroutine in quantum error mitigation and information measures estimation. We propose an unified multivariate trace estimation (UMT) which conceptually unifies the previous qubit-optimal and depth-optimal approaches with tunable quantum circuit depth and the number of qubits. The constructed circuits have $\lceil(m-1)/s\rceil$ or $n\lceil(m-1)/s\rceil$ depth corresponding to $(s+m)n$ or $s+mn$ qubits for $s\in\{1,\cdots,\lfloor m/2\rfloor\}$, respectively. Such flexible circuit structures …
Quantum information stored in a qubit is rapidly lost to the environment. The realization of robust qubits is one of the most important challenges in quantum computing. Herein we propose to embed a logical qubit within the manifold of a qudit as a scheme to preserve quantum information over extended periods of time. Under identical conditions (e.g. decoherence channels) the submanifold of the logical qubit exhibits extended lifetimes compared to a pure two-level system (qubit). The retention of quantum information further improves with separation between the sublevels of the logical qubit. Lif…
Reducing measurement errors in multi-qubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical post-processing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parameterizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by ap…
We present error mitigation (EM) techniques for noisy intermediate-scale quantum computers (QC) based on density matrix purification and perturbative corrections to the target energy. We incorporate this scheme into the variational quantum eigensolver (VQE) and demonstrate chemically-accurate ground state energy calculations of various alkali metal hydrides using IBM quantum computers. Both the density matrix purification improvements and the perturbative corrections require only meager classical computational resources, and are conducted exclusively as post-processing of the measured density …
Joint Mitigation of Algorithmic and Physical Errors in Noisy Hamiltonian Simulation
Center on Frontiers of Computing Studies, Peking University(北京大学前沿计算研究中心);School of Computer Science, Peking University(北京大学计算机学院);Tencent Quantum Laboratory, Tencent(腾讯量子实验室);Department of Mathematical Sciences, Tsinghua University(清华大学数学科学系);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);RIKEN Center for Interdisciplinary Theoretical and Mathematical Sciences (iTHEMS)(理化学研究所跨学科理论数学科学中心);RIKEN Center for Computational Science (R-CCS)(理化学研究所计算科学中心)
Rich quantum effects emerge when several quantum systems are indistinguishable from the point of view of the bath they interact with. In particular, delocalised excitations corresponding to coherent superposition of excited states appear and change drastically the dynamics and steady state of the systems. Such phenomena, which are central mechanisms of superradiance, present interesting properties for thermodynamics and potentially other quantum technologies. Indeed, a recent paper [Phys. Rev. A 99, 052105 (2019)] studies these properties in a pair of indistinguishable two-level systems and po…
A diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product factorizations of states and operators, and complex weighted finite state automata. It is then shown how one can proceed in the opposite direction: writing an automaton that ``generates'' an operator gives one an immediate matrix product factorization of it. Matrix product factorizations have the advantage of reducing the cost of computing expectation values by facilitating caching of intermediate calculations. Thus our connection to complex weighted finite state automata y…
We present a necessary and sufficient product criterion for bipartite quantum states based on the rank of realignment matrix of density matrix. Then, this approach is generalized to multipartite systems. We first introduce the concept of semiproduct in a similar manner to the semiseparable and prove that semiproduct is equivalent to fully product. Therefore, a quantum state is bipartite product with respect to all possible partitions implies fully product which is different from the case of separability. For pure states, it can easily be seen that several necessary and sufficient separability …
We show how to construct relevant families of matrix product operators in one and higher dimensions. Those form the building blocks for the numerical simulation methods based on matrix product states and projected entangled pair states. In particular, we construct translational invariant matrix product operators suitable for time evolution, and show how such descriptions are possible for Hamiltonians with long-range interactions. We illustrate how those tools can be exploited for constructing new algorithms for simulating quantum spin systems.
Quantum state tomography is a key technique for quantum information processing, but is challenging due to the exponential growth of its complexity with the system size. In this work, we propose an algorithm which iteratively finds the best non-negative matrix product state approximation based on a set of measurement outcomes whose size does not necessarily grow exponentially. Compared to the tomography method based on neural network states, our scheme utilizes a so-called tensor train representation that allows straightforward recovery of the unknown density matrix in the matrix product state …
Current descriptions of the ab initio DMRG algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab-initio DMRG sweep using a matrix product operator based code, and the equivalence to the ori…
A C++ library, named ZKCM, has been developed for the purpose of multiprecision matrix calculations, which is based on the GNU MP and MPFR libraries. It is especially convenient for writing programs involving tensor-product operations, tracing-out operations, and singular-value decompositions. Its extension library, ZKCM_QC, for simulating quantum computing has been developed using the time-dependent matrix-product-state simulation method. This report gives a brief introduction to the libraries with sample programs.
A complete classification is given for one dimensional chains with nearest neighbor interactions having two states in each site, for which a matrix product ground state exists. The Hamiltonians and their corresponding matrix product ground states are explicitly obtained.
Q-Capsule: A Localized Capsule-Based Quantum Neural Architecture for Barren Plateau Mitigation
Florida Atlantic University(佛罗里达大西洋大学);Khulna University of Engineering & Technology(库尔纳工程与技术大学);Southern Illinois University Carbondale(南伊利诺伊大学卡本代尔分校)
Using random matrix techniques and the theory of Matrix Product States we show that reduced density matrices of quantum spin chains have generically maximum entropy.
The matrix product representation provides a useful formalism to study not only entangled states, but also entangled operators in one dimension. In this paper, we focus on unitary transformations and show that matrix product operators that are unitary provides a necessary and sufficient representation of 1D unitaries that preserve locality. That is, we show that matrix product operators that are unitary are guaranteed to preserve locality by mapping local operators to local operators while at the same time all locality preserving unitaries can be represented in a matrix product way. Moreover, …
We define matrix product states in the continuum limit, without any reference to an underlying lattice parameter. This allows to extend the density matrix renormalization group and variational matrix product state formalism to quantum field theories and continuum models in 1 spatial dimension. We illustrate our procedure with the Lieb-Liniger model.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices)…
Transfer matrices and matrix product operators play an ubiquitous role in the field of many body physics. This paper gives an ideosyncratic overview of applications, exact results and computational aspects of diagonalizing transfer matrices and matrix product operators. The results in this paper are a mixture of classic results, presented from the point of view of tensor networks, and of new results. Topics discussed are exact solutions of transfer matrices in equilibrium and non-equilibrium statistical physics, tensor network states, matrix product operator algebras, and numerical matrix prod…
The eigenvectors of the particle number operator in second quantization are characterized by the block sparsity of their matrix product state representations. This is shown to generalize to other classes of operators. Imposing block sparsity yields a scheme for conserving the particle number that is commonly used in applications in physics. Operations on such block structures, their rank truncation, and implications for numerical algorithms are discussed. Explicit and rank-reduced matrix product operator representations of one- and two-particle operators are constructed that operate only on th…
This article reviews recent developments in the theoretical understanding and the numerical implementation of variational renormalization group methods using matrix product states and projected entangled pair states.
We present an implementation of the relativistic quantum-chemical density matrix renormalization group (DMRG) approach based on a matrix-product formalism. Our approach allows us to optimize matrix product state (MPS) wave functions including a variational description of scalar-relativistic effects and spin-orbit coupling from which we can calculate, for example, first-order electric and magnetic properties in a relativistic framework. While complementing our pilot implementation (S. Knecht et al., J. Chem. Phys., 140, 041101 (2014)) this work exploits all features provided by its underlying n…
We study a matrix product representation of the Bethe ansatz state for the Lieb-Linger model describing the one-dimensional Bose gas with delta-function interaction. We first construct eigenstates of the discretized model in the form of matrix product states using the algebraic Bethe ansatz. Continuous matrix product states are then exactly obtained in the continuum limit with a finite number of particles. The factorizing $F$-matrices in the lattice model are indispensable for the continuous matrix product states and lead to a marked reduction from the original bosonic system with infinite deg…