اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUnitary circuits of finite depth and infinite width from quantum channels
112
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce an approach to compute reduced density matrices for local quantum unitary circuits of finite depth and infinite width. Suppose the time-evolved state under the circuit is a matrix-product state with bond dimension $D$; then the reduced density matrix of a half-infinite system has the same spectrum as an appropriate $Dtimes D$ matrix acting on an ancilla space. We show that reduced density matrices at different spatial cuts are related by quantum channels acting on the ancilla space. This quantum channel approach allows for efficient numerical evaluation of the entanglement spectrum and Renyi entropies and their spatial fluctuations at finite times in an infinite system. We benchmark our numerical method on random unitary circuits, where many analytic results are available, and also show how our approach analytically recovers the behaviour of the kicked Ising model at the self-dual point. We study various properties of the spectra of the reduced density matrices and their spatial fluctuations in both the random and translation-invariant cases.
قيم البحث
اقرأ أيضاً
A scheme for measuring complex temperature partition functions of Ising models is introduced. In the context of ordered qubit registers this scheme finds a natural translation in terms of global operations, and single particle measurements on the edg
e of the array. Two applications of this scheme are presented. First, through appropriate Wick rotations, those amplitudes can be analytically continued to yield estimates for partition functions of Ising models. Bounds on the estimation error, valid with high confidence, are provided through a central-limit theorem, which validity extends beyond the present context. It holds for example for estimations of the Jones polynomial. Interestingly, the kind of state preparations and measurements involved in this application can in principle be made instantaneous, i.e. independent of the system size or the parameters being simulated. Second, the scheme allows to accurately estimate some non-trivial invariants of links. A third result concerns the computational power of estimations of partition functions for real temperature classical ferromagnetic Ising models on a square lattice. We provide conditions under which estimating such partition functions allows one to reconstruct scattering amplitudes of quantum circuits making the problem BQP-hard. Using this mapping, we show that fidelity overlaps for ground states of quantum Hamiltonians, which serve as a witness to quantum phase transitions, can be estimated from classical Ising model partition functions. Finally, we show that the ability to accurately measure corner magnetizations on thermal states of two-dimensional Ising models with magnetic field leads to fully polynomial random approximation schemes (FPRAS) for the partition function. Each of these results corresponds to a section of the text that can be essentially read independently.
Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity in $Dge 1
$ spatial dimensions to generate quantum error-correcting codes. For random stabilizer codes and the erasure channel, we find strong evidence that a depth $O(log N)$ random circuit is necessary and sufficient to converge (with high probability) to zero failure probability for any finite amount below the optimal erasure threshold, set by the channel capacity, for any $D$. Previous results on random circuits have only shown that $O(N^{1/D})$ depth suffices or that $O(log^3 N)$ depth suffices for all-to-all connectivity ($D to infty$). We then study the critical behavior of the erasure threshold in the so-called moderate deviation limit, where both the failure probability and the distance to the optimal threshold converge to zero with $N$. We find that the requisite depth scales like $O(log N)$ only for dimensions $D ge 2$, and that random circuits require $O(sqrt{N})$ depth for $D=1$. Finally, we introduce an expurgation algorithm that uses quantum measurements to remove logical operators that cause the code to fail by turning them into additional stabilizers or gauge operators. With such targeted measurements, we can achieve sub-logarithmic depth in $Dge 2$ below capacity without increasing the maximum weight of the check operators. We find that for any rate beneath the capacity, high-performing codes with thousands of logical qubits are achievable with depth 4-8 expurgated random circuits in $D=2$ dimensions. These results indicate that finite-rate quantum codes are practically relevant for near-term devices and may significantly reduce the resource requirements to achieve fault tolerance for near-term applications.
Let $H_1, H_2$ be Hilbert spaces of the same finite dimension $ge2$, and $C$ an arbitrary quantum circuit with (principal) input state in $H_1$ and (principal) output state in $H_2$. $C$ may use ancillas and produce garbage which is traced out. $C$ m
ay employ classical channels and measurement gates. If $C$ computes, for each computation path $mu$ through the circuit, a unitary transformation $U_mu: H_1 to H_2$ then, for each $mu$, the probability that a computation takes path $mu$ is independent of the input.
In quantum many-body systems, a Hamiltonian is called an ``extensive entropy generator if starting from a random product state the entanglement entropy obeys a volume law at long times with overwhelming probability. We prove that (i) any Hamiltonian
whose spectrum has non-degenerate gaps is an extensive entropy generator; (ii) in the space of (geometrically) local Hamiltonians, the non-degenerate gap condition is satisfied almost everywhere. Specializing to many-body localized systems, these results imply the observation stated in the title of Bardarson et al. [PRL 109, 017202 (2012)].
Models for non-unitary quantum dynamics, such as quantum circuits that include projective measurements, have been shown to exhibit rich quantum critical behavior. There are many complementary perspectives on this behavior. For example, there is a kno
wn correspondence between d-dimensional local non-unitary quantum circuits and tensor networks on a D=(d+1)-dimensional lattice. Here, we show that in the case of systems of non-interacting fermions, there is furthermore a full correspondence between non-unitary circuits in d spatial dimensions and unitary non-interacting fermion problems with static Hermitian Hamiltonians in D=(d+1) spatial dimensions. This provides a powerful new perspective for understanding entanglement phases and critical behavior exhibited by non-interacting circuits. Classifying the symmetries of the corresponding non-interacting Hamiltonian, we show that a large class of random circuits, including the most generic circuits with randomness in space and time, are in correspondence with Hamiltonians with static spatial disorder in the ten Altland-Zirnbauer symmetry classes. We find the criticality that is known to occur in all of these classes to be the origin of the critical entanglement properties of the corresponding random non-unitary circuit. To exemplify this, we numerically study the quantum states at the boundary of Haar-random Gaussian fermionic tensor networks of dimension D=2 and D=3. We show that the most general such tensor network ensemble corresponds to a unitary problem of non-interacting fermions with static disorder in Altland-Zirnbauer symmetry class DIII, which for both D=2 and D=3 is known to exhibit a stable critical metallic phase. Tensor networks and corresponding random non-unitary circuits in the other nine Altland-Zirnbauer symmetry classes can be obtained from the DIII case by implementing Clifford algebra extensions for classifying spaces.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
