اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimulating Noisy Quantum Circuits with Matrix Product Density Operators
165
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Simulating quantum circuits with classical computers requires resources growing exponentially in terms of system size. Real quantum computer with noise, however, may be simulated polynomially with various methods considering different noise models. In this work, we simulate random quantum circuits in 1D with Matrix Product Density Operators (MPDO), for different noise models such as dephasing, depolarizing, and amplitude damping. We show that the method based on Matrix Product States (MPS) fails to approximate the noisy output quantum states for any of the noise models considered, while the MPDO method approximates them well. Compared with the method of Matrix Product Operators (MPO), the MPDO method reflects a clear physical picture of noise (with inner indices taking care of the noise simulation) and quantum entanglement (with bond indices taking care of two-qubit gate simulation). Consequently, in case of weak system noise, the resource cost of MPDO will be significantly less than that of the MPO due to a relatively small inner dimension needed for the simulation. In case of strong system noise, a relatively small bond dimension may be sufficient to simulate the noisy circuits, indicating a regime that the noise is large enough for an `easy classical simulation. Moreover, we propose a more effective tensor updates scheme with optimal truncations for both the inner and the bond dimensions, performed after each layer of the circuit, which enjoys a canonical form of the MPDO for improving simulation accuracy. With truncated inner dimension to a maximum value $kappa$ and bond dimension to a maximum value $chi$, the cost of our simulation scales as $sim NDkappa^3chi^3$, for an $N$-qubit circuit with depth $D$.
قيم البحث
اقرأ أيضاً
Matrix Product States form the basis of powerful simulation methods for ground state problems in one dimension. Their power stems from the fact that they faithfully approximate states with a low amount of entanglement, the area law. In this work, we
establish the mixed state analogue of this result: We show that one-dimensional mixed states with a low amount of entanglement, quantified by the entanglement of purification, can be efficiently approximated by Matrix Product Density Operators (MPDOs). In combination with results establishing area laws for thermal states, this helps to put the use of MPDOs in the simulation of thermal states on a formal footing.
We consider the tensors generating matrix product states and density operators in a spin chain. For pure states, we revise the renormalization procedure introduced by F. Verstraete et al. in 2005 and characterize the tensors corresponding to the fixe
d points. We relate them to the states possessing zero correlation length, saturation of the area law, as well as to those which generate ground states of local and commuting Hamiltonians. For mixed states, we introduce the concept of renormalization fixed points and characterize the corresponding tensors. We also relate them to concepts like finite correlation length, saturation of the area law, as well as to those which generate Gibbs states of local and commuting Hamiltonians. One of the main result of this work is that the resulting fixed points can be associated to the boundary theories of two-dimensional topological states, through the bulk-boundary correspondence introduced by Cirac et al. in 2011.
In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leadi
ng eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm in an in-house simulator, and show that the low rank algorithm speeds up simulations by more than two orders of magnitude over an existing implementation of full rank simulator, and with negligible error in the target noise and final observables. Finally, we demonstrate the utility of the low rank method as applied to representative problems of interest by using the algorithm to speed-up noisy simulations of Grovers search algorithm and quantum chemistry solvers.
We devise a numerical scheme for the time evolution of matrix product operators by adapting the time-dependent variational principle for matrix product states [J. Haegeman et al, Phys. Rev. B 94, 165116 (2016)]. A simple augmentation of the initial o
perator $mathcal{O}$ by the Hamiltonian $H$ helps to conserve the average energy $mathrm{tr}[H mathcal{O}(t)]$ in the numerical scheme and increases the overall precision. As demonstration, we apply the improved method to a random operator on a small one-dimensional lattice, using the spin-1 Heisenberg XXZ model Hamiltonian; we observe that the augmentation reduces the trace-distance to the numerically exact time-evolved operator by a factor of 10, at the same computational cost.
Any quantum process is represented by a sequence of quantum channels. We consider ergodic processes, obtained by sampling channel valued random variables along the trajectories of an ergodic dynamical system. Examples of such processes include the ef
fect of repeated application of a fixed quantum channel perturbed by arbitrary correlated noise, or a sequence of channels drawn independently and identically from an ensemble. Under natural irreducibility conditions, we obtain a theorem showing that the state of a system evolving by such a process converges exponentially fast to an ergodic sequence of states depending on the process, but independent of the initial state of the system. As an application, we describe the thermodynamic limit of ergodic matrix product states and prove that the 2-point correlations of local observables in such states decay exponentially with their distance in the bulk. Further applications and physical implications of our results are discussed in the companion paper [11].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
