Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.17370 · Physical Review Letters

Robust detection of an entanglement transition in the projective transverse field Ising model

Felix Roser, Etienne M. Springer, Hans Peter Büchler, Nicolai Lang

quant-phcond-mat.dis-nncond-mat.stat-mechSubmitted Nov 21, 2025• Announced Nov 24, 2025• 1 citation
arXivHTMLPDF

Abstract

We propose a scalable and noise-resilient protocol for the detection of the entanglement transition in a projective version of the transverse field Ising model. Entanglement transitions are experimentally difficult to observe due to the inherent randomness of projective measurements and noise in large-scale experimental settings. Our approach combines error correction algorithms with classical shadow tomography to overcome both problems. This allows for experimentally accessible upper and lower bounds on the entanglement transition without postselection or full state tomography. These bounds remain robust under noise and their sharpness is a measure of the noise rate.

Comments
6 pages, 3 figures + Supplement (6 pages, 3 figures)

Related papers

Robust estimation of the Quantum Fisher Information on a quantum processor

Vittorio Vitale, Aniket Rath, Petar Jurcevic +3 more

We present the experimental measurement, on a quantum processor, of a series of polynomial lower bounds that converge to the quantum Fisher information (QFI), a fundamental quantity for certifying multipartite entanglement that is useful for metrological applications. We combine advanced methods of the randomized measurement toolbox to obtain estimators that are robust against drifting errors caused uniquely during the randomized measurement protocol. We estimate the QFI for Greenberg-Horne-Zeilinger states, observing genuine multipartite entanglement. Then, we prepare the ground state of the transverse field Ising model at the critical point using a variational circuit. We estimate its QFI and investigate the interplay between state optimization and noise induced by increasing the circuit depth.

arXiv:2307.16882•Jul 31, 2023•19 citations

Shadow tomography with noisy readouts

H. Chau Nguyen

Shadow tomography is a scalable technique to characterise the quantum state of a quantum computer or quantum simulator. The protocol is based on the transformation of the outcomes of random measurements into the so-called classical shadows, which can later be transformed into samples of expectation values of the observables of interest. By construction, classical shadows are intrinsically sensitive to readout noise. In fact, the complicated structure of the readout noise due to crosstalk appears to be detrimental to its scalability. We show that classical shadows accept much more flexible constructions beyond the standard ones, which can eventually be made more conformable with readout noise. With this construction, we show that readout errors in classical shadows can be efficiently mitigated by randomly flipping the qubit before, and the classical outcome bit after the measurement, referred to as $X$-twirling. That a single $X$-gate is sufficient for mitigating readout noise for classical shadows is in contrast to Clifford-twirling, where the implementation of random Clifford gates is required.

arXiv:2310.17328•Oct 26, 2023•3 citations

Experimental Demonstration of Scalable Cross-Entropy Benchmarking to Detect Measurement-Induced Phase Transitions on a Superconducting Quantum Processor

Hirsh Kamakari, Jiace Sun, Yaodong Li +5 more

Quantum systems subject to random unitary evolution and measurements at random points in spacetime exhibit entanglement phase transitions which depend on the frequency of these measurements. Past work has experimentally observed entanglement phase transitions on near-term quantum computers, but the characterization approach using entanglement entropy is not scalable due to exponential overhead of quantum state tomography and postselection. Recently, an alternative protocol to detect entanglement phase transitions using linear cross entropy was proposed, attempting to eliminate both bottlenecks. Here, we report demonstrations of this protocol in systems with one-dimensional and all-to-all connectivities on IBM's quantum hardware on up to 22 qubits, a regime which is presently inaccessible if postselection is required. We demonstrate data collapses onto scaling functions with critical exponents in semiquantitative agreement with theory. Our demonstration of the cross entropy benchmark (XEB) protocol paves the way for studies of measurement-induced entanglement phase transitions and associated critical phenomena on larger near-term quantum systems.

arXiv:2403.00938•Physical Review Letters•Mar 25, 2025•31 citations

Shadow Tomography Against Adversaries

Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia +4 more

We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of $M$ observables $O_1, \ldots, O_M$ with $\varepsilon$ accuracy, but $γ$-fraction of the outcomes can be arbitrarily corrupted by an adversary. We show that all non-adaptive shadow tomography algorithms must incur an error of $\varepsilon=\tildeΩ(γ\min\{\sqrt{M}, \sqrt{d}\})$ for some choice of observables, even with unlimited copies. Unfortunately, the classical shadows algorithm by [HKP20] and naive algorithms that directly measure each observable suffer even more. We design an algorithm that achieves an error of $\varepsilon=\tilde{O}(γ\max_{i\in[M]}\|O_i\|_{HS})$, which nearly matches our worst-case error lower bound for $M\ge d$ and guarantees better accuracy when the observables have stronger structure. Remarkably, the algorithm only needs $n=\frac{1}{γ^2}\log(M/δ)$ copies to achieve that error with probability at least $1-δ$, matching the sample complexity of the classical shadows algorithm that achieves the same error without corrupted measurement outcomes. Our algorithm is conceptually simple and easy to implement. Classical simulation for fidelity estimation shows that our algorithm enjoys much stronger robustness than [HKP20] under adversarial noise. Finally, based on a reduction from full-state tomography to shadow tomography, we prove that for rank $r$ states, both the near-optimal asymptotic error of $\varepsilon=\tilde{O}(γ\sqrt{r})$ and copy complexity $\tilde{O}(dr^2/\varepsilon^2)=\tilde{O}(dr/γ^2)$ can be achieved for adversarially robust state tomography, closing the large gap in [ABCL25] where optimal error can only be achieved using pseudo-polynomial number of copies in $d$.

quant-pharXiv:2512.05451•Dec 8, 2025•2 citations

Robust Estimation of the Quantum Fisher Information on a Quantum Processor

Vittorio Vitale, Aniket Rath, Petar Jurcevic +3 more

We present the experimental measurement, on a quantum processor, of a series of polynomial lower bounds that to the quantum Fisher information (QFI), a fundamental quantity for certifying multipartite entanglement that is useful for metrological applications. We combine advanced methods of the randomized measurement toolbox to obtain estimators that are robust regarding drifting errors caused uniquely during the randomized measurement protocol. We estimate the QFI for Greenberger-Horne-Zeilinger states, observing genuine multipartite entanglement. Then we prepare the ground state of the transverse-field Ising model at the critical point using a variational circuit. We estimate its QFI and investigate the interplay between state optimization and noise induced by our increasing the circuit depth. Published by the American Physical Society 2024

PRX Quantum•Aug 21, 2024•37 citations

Estimating localizable entanglement from witnesses

David Amaro, Markus Müller, Amit Kumar Pal

Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide useful information about the behaviour of localizable entanglement, and which can be determined by measuring a limited number of operators, or by performing the least number of measurements on the state, preferably without performing a full state tomography. In this paper, we adopt two different yet related approaches to obtain a witness-based, and a measurement-based lower bounds for localizable entanglement. The former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state, which is consistent with the expectation value of an entanglement witness. Determining this bound does not require any information about the state beyond the expectation value of the witness operator, which renders this approach highly practical in experiments. The latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis. We discuss the behaviour of both lower bounds against local physical noise on the qubits, and discuss their dependence on noise strength and system size. We also analytically determine the measurement-based lower bound in the case of graph states under local uncorrelated Pauli noise.

arXiv:1803.02753•New Journal of Physics•May 14, 2018•20 citations
We propose a scalable and noise-resilient protocol for the detection of the entanglement transition in a projective version of the transverse field Ising model. Entanglement transitions are experimentally difficult to observe due to the inherent randomness of projective measurements and noise in large-scale experimental settings. Our approach combines error correction algorithms with classical shadow tomography to overcome both problems. This allows for experimentally accessible upper and lower bounds on the entanglement transition without postselection or full state tomography. These bounds remain robust under noise and their sharpness is a measure of the noise rate.
We present the experimental measurement, on a quantum processor, of a series of polynomial lower bounds that converge to the quantum Fisher information (QFI), a fundamental quantity for certifying multipartite entanglement that is useful for metrological applications. We combine advanced methods of the randomized measurement toolbox to obtain estimators that are robust against drifting errors caused uniquely during the randomized measurement protocol. We estimate the QFI for Greenberg-Horne-Zeilinger states, observing genuine multipartite entanglement. Then, we prepare the ground state of the transverse field Ising model at the critical point using a variational circuit. We estimate its QFI and investigate the interplay between state optimization and noise induced by increasing the circuit depth.
Shadow tomography is a scalable technique to characterise the quantum state of a quantum computer or quantum simulator. The protocol is based on the transformation of the outcomes of random measurements into the so-called classical shadows, which can later be transformed into samples of expectation values of the observables of interest. By construction, classical shadows are intrinsically sensitive to readout noise. In fact, the complicated structure of the readout noise due to crosstalk appears to be detrimental to its scalability. We show that classical shadows accept much more flexible constructions beyond the standard ones, which can eventually be made more conformable with readout noise. With this construction, we show that readout errors in classical shadows can be efficiently mitigated by randomly flipping the qubit before, and the classical outcome bit after the measurement, referred to as XXX-twirling. That a single XXX-gate is sufficient for mitigating readout noise for classical shadows is in contrast to Clifford-twirling, where the implementation of random Clifford gates is required.
Quantum systems subject to random unitary evolution and measurements at random points in spacetime exhibit entanglement phase transitions which depend on the frequency of these measurements. Past work has experimentally observed entanglement phase transitions on near-term quantum computers, but the characterization approach using entanglement entropy is not scalable due to exponential overhead of quantum state tomography and postselection. Recently, an alternative protocol to detect entanglement phase transitions using linear cross entropy was proposed, attempting to eliminate both bottlenecks. Here, we report demonstrations of this protocol in systems with one-dimensional and all-to-all connectivities on IBM's quantum hardware on up to 22 qubits, a regime which is presently inaccessible if postselection is required. We demonstrate data collapses onto scaling functions with critical exponents in semiquantitative agreement with theory. Our demonstration of the cross entropy benchmark (XEB) protocol paves the way for studies of measurement-induced entanglement phase transitions and associated critical phenomena on larger near-term quantum systems.
We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of MMM observables O1,…,OMO_1, \ldots, O_MO1​,…,OM​ with ε\varepsilonε accuracy, but γγγ-fraction of the outcomes can be arbitrarily corrupted by an adversary. We show that all non-adaptive shadow tomography algorithms must incur an error of ε=Ω~(γmin⁡{M,d})\varepsilon=\tildeΩ(γ\min\{\sqrt{M}, \sqrt{d}\})ε=Ω~(γmin{M​,d​}) for some choice of observables, even with unlimited copies. Unfortunately, the classical shadows algorithm by [HKP20] and naive algorithms that directly measure each observable suffer even more. We design an algorithm that achieves an error of ε=O~(γmax⁡i∈[M]∥Oi∥HS)\varepsilon=\tilde{O}(γ\max_{i\in[M]}\|O_i\|_{HS})ε=O~(γmaxi∈[M]​∥Oi​∥HS​), which nearly matches our worst-case error lower bound for M≥dM\ge dM≥d and guarantees better accuracy when the observables have stronger structure. Remarkably, the algorithm only needs n=1γ2log⁡(M/δ)n=\frac{1}{γ^2}\log(M/δ)n=γ21​log(M/δ) copies to achieve that error with probability at least 1−δ1-δ1−δ, matching the sample complexity of the classical shadows algorithm that achieves the same error without corrupted measurement outcomes. Our algorithm is conceptually simple and easy to implement. Classical simulation for fidelity estimation shows that our algorithm enjoys much stronger robustness than [HKP20] under adversarial noise. Finally, based on a reduction from full-state tomography to shadow tomography, we prove that for rank rrr states, both the near-optimal asymptotic error of ε=O~(γr)\varepsilon=\tilde{O}(γ\sqrt{r})ε=O~(γr​) and copy complexity O~(dr2/ε2)=O~(dr/γ2)\tilde{O}(dr^2/\varepsilon^2)=\tilde{O}(dr/γ^2)O~(dr2/ε2)=O~(dr/γ2) can be achieved for adversarially robust state tomography, closing the large gap in [ABCL25] where optimal error can only be achieved using pseudo-polynomial number of copies in ddd.
We present the experimental measurement, on a quantum processor, of a series of polynomial lower bounds that to the quantum Fisher information (QFI), a fundamental quantity for certifying multipartite entanglement that is useful for metrological applications. We combine advanced methods of the randomized measurement toolbox to obtain estimators that are robust regarding drifting errors caused uniquely during the randomized measurement protocol. We estimate the QFI for Greenberger-Horne-Zeilinger states, observing genuine multipartite entanglement. Then we prepare the ground state of the transverse-field Ising model at the critical point using a variational circuit. We estimate its QFI and investigate the interplay between state optimization and noise induced by our increasing the circuit depth. Published by the American Physical Society 2024
Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide useful information about the behaviour of localizable entanglement, and which can be determined by measuring a limited number of operators, or by performing the least number of measurements on the state, preferably without performing a full state tomography. In this paper, we adopt two different yet related approaches to obtain a witness-based, and a measurement-based lower bounds for localizable entanglement. The former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state, which is consistent with the expectation value of an entanglement witness. Determining this bound does not require any information about the state beyond the expectation value of the witness operator, which renders this approach highly practical in experiments. The latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis. We discuss the behaviour of both lower bounds against local physical noise on the qubits, and discuss their dependence on noise strength and system size. We also analytically determine the measurement-based lower bound in the case of graph states under local uncorrelated Pauli noise.