Search arXivSearch

arXiv · 2209.04393

Entanglement barrier and its symmetry resolution: theory and experiment

Abstract

The operator entanglement (OE) is a key quantifier of the complexity of a reduced density matrix. In out-of-equilibrium situations, e.g. after a quantum quench of a product state, it is expected to exhibit an entanglement barrier. The OE of a reduced density matrix initially grows linearly as entanglement builds up between the local degrees of freedom, it then reaches a maximum, and ultimately decays to a small finite value as the reduced density matrix converges to a simple stationary state through standard thermalization mechanisms. Here, by performing a new data analysis of the published experimental results of [Brydges et al., Science 364, 260 (2019)], we obtain the first experimental measurement of the OE of a subsystem reduced density matrix in a quantum many-body system. We employ the randomized measurements toolbox and we introduce and develop a new efficient method to post-process experimental data in order to extract higher-order density matrix functionals and access the OE. The OE thus obtained displays the expected barrier as long as the experimental system is large enough. For smaller systems, we observe a barrier with a double-peak structure, whose origin can be interpreted in terms of pairs of quasi-particles being reflected at the boundary of the qubit chain. As $U(1)$ symmetry plays a key role in our analysis, we introduce the notion of symmetry resolved operator entanglement (SROE), in addition to the total OE. To gain further insights into the SROE, we provide a thorough theoretical analysis of this new quantity in chains of non-interacting fermions, which, in spite of their simplicity, capture most of the main features of OE and SROE. In particular, we uncover three main physical effects: the presence of a barrier in any charge sector, a time delay for the onset of the growth of SROE, and an effective equipartition between charge sectors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aniket Rath, Vittorio Vitale, Sara Murciano, Matteo Votto, Jérôme Dubail, Richard Kueng, Cyril Branciard, Pasquale Calabrese, Benoît Vermersch. 2022-09-09. Entanglement barrier and its symmetry resolution: theory and experiment. https://doi.org/10.1103/prxquantum.4.010318

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph