pith. sign in

arxiv: 2505.09512 · v4 · submitted 2025-05-14 · 🪐 quant-ph

Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence

Zhong-Xia Shang , Si-Yuan Chen , Wenjun Yu , Giulio Chiribella , Qi Zhao This is my paper

Pith reviewed 2026-05-22 15:36 UTC · model grok-4.3

classification 🪐 quant-ph
keywords bra-ket entanglementquantum resourcesentanglement generationmagiccoherenceresource theoryquantum simulation
0
0 comments X

The pith

Bra-ket entanglement governs a transition where coherence drives entanglement growth at low values but magic dominates at high values.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces bra-ket entanglement as an indicator defined in the operator vectorization space to connect the three quantum resources of entanglement, magic, and coherence. It establishes that this indicator controls a shift in which resource primarily generates entanglement. At low bra-ket entanglement levels, coherence dominates the growth of entanglement with minimal role for magic. As the indicator value rises, magic gradually supplants coherence. At high levels, entanglement generation depends mainly on magic and becomes largely independent of coherence. The results rest on new entropy relations and numerical verification, pointing to consequences for classical simulation of mixed states.

Core claim

Bra-ket entanglement (BKE) governs a resource dependence transition in the generation of entanglement: in the low-BKE regime, the growth of entanglement is dominated by coherence, largely independent of magic. However, as BKE increases, the dependence on coherence will gradually be replaced by a dependence on magic. Consequently, in the high-BKE regime, entanglement generation becomes dominated by magic, largely independent of coherence.

What carries the argument

Bra-ket entanglement (BKE) defined in the operator vectorization space, which bridges the three resources by governing their dependence transitions during entanglement generation.

If this is right

  • The transition implies new entropy-theoretic relations that tie the three resources together through BKE.
  • Resource transitions appear in classical simulations of mixed states and marginal probabilities.
  • Different classical simulation methods can be related through these BKE-dependent transitions.
  • Numerical experiments confirm the dominance shift across regimes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If BKE proves controllable in experiments, it could inform circuit designs that allocate coherence and magic resources efficiently for target entanglement levels.
  • The same transition pattern may appear when studying other resource theories that involve multiple nonclassical features.
  • Higher-dimensional or continuous-variable extensions could test whether the low-to-high BKE crossover remains sharp.

Load-bearing premise

The definition of bra-ket entanglement in the operator vectorization space provides a faithful bridge between entanglement, magic, and coherence that is not an artifact of the chosen representation.

What would settle it

A counterexample in which entanglement growth fails to exhibit the predicted shift from coherence dominance at low BKE to magic dominance at high BKE, either through explicit calculation on small systems or through numerical sampling across random states.

Figures

Figures reproduced from arXiv: 2505.09512 by Giulio Chiribella, Qi Zhao, Si-Yuan Chen, Wenjun Yu, Zhong-Xia Shang.

Figure 1
Figure 1. Figure 1: FIG. 1. Tensor network representation of vectorization of [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Relating (space) entanglement to CBC (coherence) and BBC (magic) via BKE. When BKE of [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. (a): Gradient diagram of SE of [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. The same setting as Fig [PITH_FULL_IMAGE:figures/full_fig_p022_4.png] view at source ↗
read the original abstract

Understanding the intricate interplay between distinct quantum resources is a fundamental prerequisite for rigorously characterizing the boundary between classical and quantum technologies. Among the vast landscape of quantum resources, entanglement, magic, and coherence have arguably attracted the most intense investigation. However, while universally recognized as the core drivers of quantum advantage, our understanding of their structural interplay remains fragmented and compartmentalized. In this work, we introduce an indicator called {\em bra-ket entanglement} (BKE) defined in the operator vectorization space to bridge all three quantum resources. Specifically, we show that BKE governs a resource dependence transition in the generation of entanglement: in the low-BKE regime, the growth of entanglement is dominated by coherence, largely independent of magic. However, as BKE increases, the dependence on coherence will gradually be replaced by a dependence on magic. Consequently, in the high-BKE regime, entanglement generation becomes dominated by magic, largely independent of coherence. These results are built on a series of new entropy-theoretic relations and are verified through numerical experiments. We also discuss implications of our results for the resource transitions in classical simulations of mixed states and marginal probabilities and for relating different classical simulation methods.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces bra-ket entanglement (BKE) defined via operator vectorization as a new indicator bridging entanglement, magic, and coherence. It claims that BKE governs a sharp resource-dependence transition in entanglement generation: low-BKE regimes exhibit entanglement growth dominated by coherence and largely independent of magic, while high-BKE regimes exhibit dominance by magic and independence from coherence. The claims rest on newly derived entropy-theoretic relations together with numerical experiments; implications for classical simulation of mixed states and marginal probabilities are also discussed.

Significance. If the transition is shown to be independent of the vectorization embedding, the work would supply a concrete bridge among three major quantum resources and could inform both resource-theoretic classifications and practical questions about when coherence versus magic controls entanglement growth. The entropy relations and numerical verification are presented as supporting evidence, but the overall significance hinges on whether BKE reveals an external phenomenon rather than an algebraic feature of the chosen representation.

major comments (2)
  1. [Definition of BKE] Definition of BKE (operator vectorization space): because entanglement, magic, and coherence are all quantified inside the same vectorized operator space, the claimed coherence-to-magic transition may be partly induced by the representation itself (e.g., how partial traces or stabilizer entropies transform under vectorization). The manuscript should test whether the transition survives under an inequivalent embedding such as the Choi isomorphism or a reordered basis; without such a check the bridging role of BKE remains open to the circularity concern.
  2. [Numerical experiments] Numerical experiments section: the verification of the dependence transition lacks explicit error bars, data-exclusion criteria, and a statement of the precise assumptions under which the new entropy relations hold. These omissions make it impossible to judge whether the numerics robustly confirm the central claim or merely illustrate it under favorable conditions.
minor comments (2)
  1. [Abstract] The abstract could state more precisely which entropy relations are new and how they directly imply the transition.
  2. [Preliminaries] Notation for the vectorization map and the definition of BKE should be introduced with an explicit equation number for later reference.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment in turn below, indicating where revisions will be made.

read point-by-point responses

  1. Referee: [Definition of BKE] Definition of BKE (operator vectorization space): because entanglement, magic, and coherence are all quantified inside the same vectorized operator space, the claimed coherence-to-magic transition may be partly induced by the representation itself (e.g., how partial traces or stabilizer entropies transform under vectorization). The manuscript should test whether the transition survives under an inequivalent embedding such as the Choi isomorphism or a reordered basis; without such a check the bridging role of BKE remains open to the circularity concern.

    Authors: We appreciate the referee raising the possibility of representation dependence. The operator vectorization is the canonical map that simultaneously encodes the partial trace (for entanglement), the Pauli-string expansion (for stabilizer entropy and magic), and the off-diagonal coherences within a single Hilbert space; the entropy relations we derive follow from this structure and the subadditivity properties of the respective entropies. Nevertheless, we agree that an explicit robustness check would strengthen the claim. In the revised manuscript we will add a dedicated paragraph explaining why the qualitative transition is expected to persist under basis reordering (because BKE is defined via the Frobenius inner product, which is basis-independent) and why the Choi isomorphism yields an equivalent resource-transition picture (the isomorphism preserves the relevant marginals and stabilizer properties up to local unitaries). A full side-by-side numerical comparison with reordered bases will be included in the supplementary material. revision: partial

  2. Referee: [Numerical experiments] Numerical experiments section: the verification of the dependence transition lacks explicit error bars, data-exclusion criteria, and a statement of the precise assumptions under which the new entropy relations hold. These omissions make it impossible to judge whether the numerics robustly confirm the central claim or merely illustrate it under favorable conditions.

    Authors: We thank the referee for identifying these presentational gaps. In the revised manuscript we will (i) add statistical error bars to all plots that display the coherence-to-magic transition, (ii) explicitly state the data-exclusion criteria (states are retained only if the sampled density matrix satisfies purity > 0.1 and the entropy estimators converge to within 10^{-3}), and (iii) insert a paragraph clarifying the assumptions: the entropy relations hold exactly for finite-dimensional systems under the standard definitions of von Neumann, stabilizer, and coherence entropies, while the numerics illustrate the transition for random mixed states drawn from the Ginibre ensemble in dimensions up to 8. These additions will make the numerical support fully reproducible and transparent. revision: yes

Circularity Check

0 steps flagged

No significant circularity; BKE bridge rests on independent relations and numerics

full rationale

The paper introduces bra-ket entanglement as a new indicator in the operator vectorization space and derives a series of new entropy-theoretic relations to demonstrate the claimed coherence-to-magic transition in entanglement generation. These relations, together with explicit numerical experiments, supply independent content that does not reduce to the BKE definition by algebraic construction. The shared vectorization representation is a deliberate modeling choice for unification rather than a source of tautological dependence; the transition is shown to vary with BKE through concrete calculations rather than being forced by the representation itself. No load-bearing self-citations, fitted parameters renamed as predictions, or uniqueness theorems imported from prior author work appear in the derivation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on the suitability of the operator vectorization space and on the validity of newly introduced entropy relations; BKE itself is an invented bridging quantity without cited independent evidence outside this work.

axioms (1)
  • domain assumption The operator vectorization space supplies a natural and non-distorting arena in which to define a measure that simultaneously captures entanglement, magic, and coherence.
    This assumption is required for the definition of BKE to be meaningful.
invented entities (1)
  • Bra-ket entanglement (BKE) no independent evidence
    purpose: To serve as a single indicator that bridges entanglement, magic, and coherence and governs their resource dependence transition.
    BKE is introduced in this paper; no prior independent evidence or falsifiable prediction outside the present framework is mentioned.

pith-pipeline@v0.9.0 · 5746 in / 1345 out tokens · 52121 ms · 2026-05-22T15:36:40.825151+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

70 extracted references · 70 canonical work pages · 6 internal anchors

  1. [1]

    Quantum computing in the nisq era and beyond.Quantum, 2:79, 2018

    John Preskill. Quantum computing in the nisq era and beyond.Quantum, 2:79, 2018

    work page 2018

  2. [2]

    Beyond nisq: The megaquop machine, 2025

    John Preskill. Beyond nisq: The megaquop machine, 2025

    work page 2025

  3. [3]

    Quantum resource theories.Reviews of modern physics, 91(2):025001, 2019

    Eric Chitambar and Gilad Gour. Quantum resource theories.Reviews of modern physics, 91(2):025001, 2019

    work page 2019

  4. [4]

    Cambridge university press, 2010

    Michael A Nielsen and Isaac L Chuang.Quantum computation and quantum information. Cambridge university press, 2010

    work page 2010

  5. [5]

    Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels.Physical review letters, 70(13):1895, 1993

    Charles H Bennett, Gilles Brassard, Claude Cr´ epeau, Richard Jozsa, Asher Peres, and William K Wootters. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels.Physical review letters, 70(13):1895, 1993

    work page 1993

  6. [6]

    On the role of coherence in shor’s algorithm.arXiv preprint arXiv:2203.10632, 2022

    Felix Ahnefeld, Thomas Theurer, Dario Egloff, Juan Mauricio Matera, and Martin B Plenio. On the role of coherence in shor’s algorithm.arXiv preprint arXiv:2203.10632, 2022

    work page arXiv 2022

  7. [7]

    Entanglement accelerates quantum simulation.Nature Physics, 21(8):1338– 1345, 2025

    Qi Zhao, You Zhou, and Andrew M Childs. Entanglement accelerates quantum simulation.Nature Physics, 21(8):1338– 1345, 2025

    work page 2025

  8. [8]

    Every quantum helps: Operational advantage of quantum resources beyond convexity.Physical Review Letters, 132(15):150201, 2024

    Kohdai Kuroiwa, Ryuji Takagi, Gerardo Adesso, and Hayata Yamasaki. Every quantum helps: Operational advantage of quantum resources beyond convexity.Physical Review Letters, 132(15):150201, 2024

    work page 2024

  9. [9]

    Unconditional quantum magic advantage in shallow circuit computation

    Xingjian Zhang, Zhaokai Pan, and Guoding Liu. Unconditional quantum magic advantage in shallow circuit computation. Nature Communications, 15(1):10513, 2024

    work page 2024

  10. [10]

    Quantum advantage of unitary clifford circuits with magic state inputs.Proceedings of the Royal Society A, 475(2225):20180427, 2019

    Mithuna Yoganathan, Richard Jozsa, and Sergii Strelchuk. Quantum advantage of unitary clifford circuits with magic state inputs.Proceedings of the Royal Society A, 475(2225):20180427, 2019

    work page 2019

  11. [11]

    Role of coherence for quantum computational advantage.Physical Review Letters, 135(15):150602, 2025

    Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher, Elham Kashefi, Harold Ollivier, and Ulysse Chabaud. Role of coherence for quantum computational advantage.Physical Review Letters, 135(15):150602, 2025. 8

    work page 2025

  12. [12]

    Tensor networks for complex quantum systems.Nature Reviews Physics, 1(9):538–550, 2019

    Rom´ an Or´ us. Tensor networks for complex quantum systems.Nature Reviews Physics, 1(9):538–550, 2019

    work page 2019

  13. [13]

    The Heisenberg Representation of Quantum Computers

    Daniel Gottesman. The heisenberg representation of quantum computers.arXiv preprint quant-ph/9807006, 1998

    work page internal anchor Pith review Pith/arXiv arXiv 1998

  14. [14]

    Improved simulation of stabilizer circuits.Physical Review A—Atomic, Molecular, and Optical Physics, 70(5):052328, 2004

    Scott Aaronson and Daniel Gottesman. Improved simulation of stabilizer circuits.Physical Review A—Atomic, Molecular, and Optical Physics, 70(5):052328, 2004

    work page 2004

  15. [15]

    Efficient classical simulation of slightly entangled quantum computations.Physical review letters, 91(14):147902, 2003

    Guifr´ e Vidal. Efficient classical simulation of slightly entangled quantum computations.Physical review letters, 91(14):147902, 2003

    work page 2003

  16. [16]

    Hybrid schr¨ odinger-feynman simulation of quantum circuits with decision diagrams

    Lukas Burgholzer, Hartwig Bauer, and Robert Wille. Hybrid schr¨ odinger-feynman simulation of quantum circuits with decision diagrams. In2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 199–

    work page

  17. [17]

    Quantum entanglement.Reviews of modern physics, 81(2):865–942, 2009

    Ryszard Horodecki, Pawe l Horodecki, Micha l Horodecki, and Karol Horodecki. Quantum entanglement.Reviews of modern physics, 81(2):865–942, 2009

    work page 2009

  18. [18]

    The resource theory of stabilizer quantum computation.New Journal of Physics, 16(1):013009, 2014

    Victor Veitch, SA Hamed Mousavian, Daniel Gottesman, and Joseph Emerson. The resource theory of stabilizer quantum computation.New Journal of Physics, 16(1):013009, 2014

    work page 2014

  19. [19]

    Colloquium: Quantum coherence as a resource.Reviews of Modern Physics, 89(4):041003, 2017

    Alexander Streltsov, Gerardo Adesso, and Martin B Plenio. Colloquium: Quantum coherence as a resource.Reviews of Modern Physics, 89(4):041003, 2017

    work page 2017

  20. [20]

    Quantum cryptography based on bell’s theorem.Physical review letters, 67(6):661, 1991

    Artur K Ekert. Quantum cryptography based on bell’s theorem.Physical review letters, 67(6):661, 1991

    work page 1991

  21. [21]

    Matrix product states and projected entangled pair states: Concepts, symmetries, theorems.Reviews of Modern Physics, 93(4):045003, 2021

    J Ignacio Cirac, David Perez-Garcia, Norbert Schuch, and Frank Verstraete. Matrix product states and projected entangled pair states: Concepts, symmetries, theorems.Reviews of Modern Physics, 93(4):045003, 2021

    work page 2021

  22. [22]

    Matrix Product State Representations

    David Perez-Garcia, Frank Verstraete, Michael M Wolf, and J Ignacio Cirac. Matrix product state representations.arXiv preprint quant-ph/0608197, 2006

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  23. [23]

    Universal quantum computation with ideal clifford gates and noisy ancillas.Physical Review A—Atomic, Molecular, and Optical Physics, 71(2):022316, 2005

    Sergey Bravyi and Alexei Kitaev. Universal quantum computation with ideal clifford gates and noisy ancillas.Physical Review A—Atomic, Molecular, and Optical Physics, 71(2):022316, 2005

    work page 2005

  24. [24]

    Stabilizer r´ enyi entropy.Physical Review Letters, 128(5):050402, 2022

    Lorenzo Leone, Salvatore FE Oliviero, and Alioscia Hamma. Stabilizer r´ enyi entropy.Physical Review Letters, 128(5):050402, 2022

    work page 2022

  25. [25]

    Magic of the heisenberg picture.arXiv preprint arXiv:2408.16047, 2024

    Neil Dowling, Pavel Kos, and Xhek Turkeshi. Magic of the heisenberg picture.arXiv preprint arXiv:2408.16047, 2024

    work page arXiv 2024

  26. [26]

    A polynomial-time classical algorithm for noisy quantum circuits.arXiv preprint arXiv:2407.12768, 2024

    Thomas Schuster, Chao Yin, Xun Gao, and Norman Y Yao. A polynomial-time classical algorithm for noisy quantum circuits.arXiv preprint arXiv:2407.12768, 2024

    work page arXiv 2024

  27. [27]

    A polynomial-time classical algorithm for noisy random circuit sampling

    Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, and Umesh Vazirani. A polynomial-time classical algorithm for noisy random circuit sampling. InProceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 945–957, 2023

    work page 2023

  28. [28]

    Simulating quantum circuits with arbitrary local noise using Pauli Propagation

    Armando Angrisani, Antonio A Mele, Manuel S Rudolph, M Cerezo, and Zoe Holmes. Simulating quantum circuits with arbitrary local noise using pauli propagation.arXiv preprint arXiv:2501.13101, 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  29. [29]

    Angrisani, A

    Armando Angrisani, Alexander Schmidhuber, Manuel S Rudolph, M Cerezo, Zo¨ e Holmes, and Hsin-Yuan Huang. Classi- cally estimating observables of noiseless quantum circuits.arXiv preprint arXiv:2409.01706, 2024

    work page arXiv 2024

  30. [30]

    Quantum interference as a resource for quantum speedup.Physical Review A, 90(2):022302, 2014

    Dan Stahlke. Quantum interference as a resource for quantum speedup.Physical Review A, 90(2):022302, 2014

    work page 2014

  31. [31]

    Advances in quantum metrology.Nature photonics, 5(4):222–229, 2011

    Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. Advances in quantum metrology.Nature photonics, 5(4):222–229, 2011

    work page 2011

  32. [32]

    Quantum computing and polynomial equations over the finite field Z_2

    Christopher M Dawson, Henry L Haselgrove, Andrew P Hines, Duncan Mortimer, Michael A Nielsen, and Tobias J Osborne. Quantum computing and polynomial equations over the finite field z 2.arXiv preprint quant-ph/0408129, 2004

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  33. [33]

    Entanglement in Graph States and its Applications

    Marc Hein, Wolfgang D¨ ur, Jens Eisert, Robert Raussendorf, M Nest, and H-J Briegel. Entanglement in graph states and its applications.arXiv preprint quant-ph/0602096, 2006

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  34. [34]

    Quantifying nonstabilizerness of matrix product states.Physical Review B, 107(3):035148, 2023

    Tobias Haug and Lorenzo Piroli. Quantifying nonstabilizerness of matrix product states.Physical Review B, 107(3):035148, 2023

    work page 2023

  35. [35]

    Dowling, K

    Neil Dowling, Kavan Modi, and Gregory AL White. Bridging entanglement and magic resources through operator space. arXiv preprint arXiv:2501.18679, 2025

    work page arXiv 2025

  36. [36]

    Shannon entropy, renyi entropy, and information.Statistics and Inf

    PA Bromiley, NA Thacker, and E Bouhova-Thacker. Shannon entropy, renyi entropy, and information.Statistics and Inf. Series (2004-004), 9(2004):2–8, 2004

    work page 2004

  37. [37]

    Mixed-state entanglement and quantum error correction.Physical Review A, 54(5):3824, 1996

    Charles H Bennett, David P DiVincenzo, John A Smolin, and William K Wootters. Mixed-state entanglement and quantum error correction.Physical Review A, 54(5):3824, 1996

    work page 1996

  38. [38]

    Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature?Physical Review Letters, 80(24):5239, 1998

    Micha l Horodecki, Pawe l Horodecki, and Ryszard Horodecki. Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature?Physical Review Letters, 80(24):5239, 1998

    work page 1998

  39. [39]

    Operator space entanglement entropy in a transverse ising chain.Physical Review A—Atomic, Molecular, and Optical Physics, 76(3):032316, 2007

    Tomaˇ z Prosen and Iztok Piˇ zorn. Operator space entanglement entropy in a transverse ising chain.Physical Review A—Atomic, Molecular, and Optical Physics, 76(3):032316, 2007

    work page 2007

  40. [40]

    M. A. Nielsen. Probability distributions consistent with a mixed state.Physical Review A, 62(5), October 2000

    work page 2000

  41. [41]

    Cambridge University Press, 2014

    Ryan O’Donnell.Analysis of boolean functions. Cambridge University Press, 2014

    work page 2014

  42. [42]

    Entropic uncertainty relations and their appli- cations.Reviews of Modern Physics, 89(1):015002, 2017

    Patrick J Coles, Mario Berta, Marco Tomamichel, and Stephanie Wehner. Entropic uncertainty relations and their appli- cations.Reviews of Modern Physics, 89(1):015002, 2017

    work page 2017

  43. [43]

    Mindspore quantum: A user-friendly, high-performance, and ai-compatible quantum computing framework, 2024

    Xusheng Xu, Jiangyu Cui, Zidong Cui, Runhong He, Qingyu Li, Xiaowei Li, Yanling Lin, Jiale Liu, Wuxin Liu, Jiale Lu, et al. Mindspore quantum: A user-friendly, high-performance, and ai-compatible quantum computing framework, 2024

    work page 2024

  44. [44]

    HT forent: Source code for numerical simulations of bra-ket entanglement.https://github.com/ ChanceSiyuan/HT_forent, 2026

    Si-Yuan Chen. HT forent: Source code for numerical simulations of bra-ket entanglement.https://github.com/ ChanceSiyuan/HT_forent, 2026

    work page 2026

  45. [45]

    How to simulate quantum measurement without computing marginals

    Sergey Bravyi, David Gosset, and Yinchen Liu. How to simulate quantum measurement without computing marginals. Physical Review Letters, 128(22):220503, 2022

    work page 2022

  46. [46]

    Classical simulability of quantum circuits with shallow magic depth.PRX Quantum, 9 6(1):010337, 2025

    Yifan Zhang and Yuxuan Zhang. Classical simulability of quantum circuits with shallow magic depth.PRX Quantum, 9 6(1):010337, 2025

    work page 2025

  47. [47]

    Completely positive linear maps on complex matrices.Linear algebra and its applications, 10(3):285–290, 1975

    Man-Duen Choi. Completely positive linear maps on complex matrices.Linear algebra and its applications, 10(3):285–290, 1975

    work page 1975

  48. [48]

    Courier Corporation, 2012

    Robert B Ash.Information theory. Courier Corporation, 2012

    work page 2012

  49. [49]

    Conservative logic.International Journal of theoretical physics, 21(3):219–253, 1982

    Edward Fredkin and Tommaso Toffoli. Conservative logic.International Journal of theoretical physics, 21(3):219–253, 1982

    work page 1982

  50. [50]

    The Clifford group forms a unitary 3-design

    Zak Webb. The clifford group forms a unitary 3-design.arXiv preprint arXiv:1510.02769, 2015. 10 SUPPLEMENTARY MATERIAL A. Preliminaries 10

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  51. [51]

    R´ enyi entropy and entropic uncertainty principle 10

    work page

  52. [52]

    Entanglement in vectorization space 11

    Vectorization 11 B. Entanglement in vectorization space 11

    work page

  53. [53]

    Space entanglement (SE) 12

    work page

  54. [54]

    Coherence in vectorization space 13

    bra-ket entanglement (BKE) 12 C. Coherence in vectorization space 13

    work page

  55. [55]

    Computational basis coherence (CBC) 13

    work page

  56. [56]

    BKE diagnoses SE 15

    Bell basis coherence (BBC) 14 D. BKE diagnoses SE 15

    work page

  57. [57]

    CBC and BBC bound SE 15

    work page

  58. [58]

    BKE bounds CBC and BBC 16 E.F CBC vsF BBC 19

    work page

  59. [59]

    Application of BKE-matching operators 22 This supplementary material can be seen as a more detailed version compared to the main text

    Magic-coherence Duality 19 2.CCXvsT 21 F. Application of BKE-matching operators 22 This supplementary material can be seen as a more detailed version compared to the main text. Appendix A: Preliminaries

    work page

  60. [60]

    R´ enyi entropy and entropic uncertainty principle Definition 1.Given aD-dimensional probability distribution{p i}, theα-order R´ enyi entropy [36] with0≤α≤ ∞ andα̸= 1is defined as Hα({pi}) = 1 1−α log X i pα i ! .(A1) Throughout this work, we will use log(·) with base 2.H α({pi}) atα= 1 andα=∞are defined by taking the limit, and we have H1({pi}) = lim α→...

    work page

  61. [61]

    Vectorization We will mainly use the vectorization picture for the presentation. Definition 2(Vectorization).The mapping vectorizationV[O] =|O⟩⟩maps an-qubit matrixO= P ij oij|i⟩⟨j|in operator spaceC 2n×2n to a2n-qubit vector|O⟩⟩= (O⊗I n)P j |j⟩|j⟩= P ij oij|i⟩|j⟩in the vectorization spaceC 22n . |O⟩⟩is also known as the Choi state ofO[47]. Here, we summa...

    work page

  62. [62]

    Appendix B: Entanglement in vectorization space As illustrated in Fig

    In the following, we will mainly usePto denote an-qubit Pauli operator and use|B⟩to denote its corresponding vectorized 2n-qubit Bell state. Appendix B: Entanglement in vectorization space As illustrated in Fig. 1 in the main text, we will call the subsystemacthe upper subsystem (US) and the subsystem bdthe lower subsystem (LS). And we will call the subsy...

    work page

  63. [63]

    Space entanglement (SE) Space entanglement (SE) is related to space bipartition. In operator space,Ohas the unique operator singular value decomposition O= X i siOu,i ⊗O l,i.(B1) BecauseOis normalized,{s i}satisfys i ≥0 and P i s2 i = 1, andO u,i andO l,i are orthogonal and normalized matrices satisfying Tr O† u/l,iOu/l,j =δ ij. In vectorization picture, ...

    work page

  64. [64]

    bra-ket entanglement (BKE) bra-ket entanglement (BKE) is related to bra-ket bipartition. Under (ab|cd), we can again write down a unique Schmidt decomposition of|O⟩ |O⟩= X i γi|Or,i⟩ ⊗ |Oc,i⟩,(B4) where{γ i}satisfyγ i ≥0 and P i γ2 i = 1, and|O r,i⟩and|O c,i⟩are orthogonal states in RS and CS respectively: ⟨Or,i|Or,j⟩=⟨O c,i|Oc,j⟩=δ ij. With the Schmidt c...

    work page

  65. [65]

    Computational basis coherence (CBC) The operatorOcan be decomposed in matrix element basis and can be further mapped into the computational basis in vectorization space O= X ij oij|i⟩⟨j| V − → |O⟩= X ij oij|i⟩|j⟩,(C1) which leads to the definition of CBC-R´ enyi entropy. Definition 6(CBC-R´ enyi entropy).Theα-order CBC-R´ enyi entropy is defined as HCBC,α...

    work page

  66. [66]

    Bell basis coherence (BBC) The operatorOcan be decomposed in another basis: the Pauli basis, and can be further mapped into the Bell basis in vectorization space O= 2 −n/2X i biPi V − → |O⟩= X i bi|Bi⟩,(C7) which leads to the definition of BBC-R´ enyi entropy. Definition 7(BBC-R´ enyi entropy).Theα-order BBC-R´ enyi entropy is defined as HBBC,α(O) = 1 1−α...

    work page

  67. [67]

    Lemma 7.Given anqubit system with basis{B 1,· · ·, B n2 }such that tr(B jB† k) =δ jk andB j =O (1) j ⊗ · · · ⊗O (n) j are tensor product operators

    CBC and BBC bound SE Through the above definitions, we can now give a formal theorem to relate SE with CBC and BBC. Lemma 7.Given anqubit system with basis{B 1,· · ·, B n2 }such that tr(B jB† k) =δ jk andB j =O (1) j ⊗ · · · ⊗O (n) j are tensor product operators. Then the decompositionO= Pn2 j=1 cjBj satisfiedH α({c2 i })≥H SE,α(O) Proof.R´ enyi entropy a...

    work page

  68. [68]

    BKE bounds CBC and BBC We have seen from above that forO=|0⟩⟨0| ⊗n, CBC is required for generating higher entanglement, while for O=P, BBC is required for generating higher entanglement. Therefore, a natural question is what properties of|O⟩ decide which resource is more desired regarding increasing SE? An observation is that for|O⟩=|0⟩ ⊗n|0⟩⊗n, it is a p...

    work page

  69. [69]

    However,F CBC is not merely Clifford circuits with the Pauli basis mapped to the computational basis

    Magic-coherence Duality FCBC is composed of permutation and diagonal phase gates on the computational basis, andF BBC are Clifford circuit with also permutation and phase effects on the Pauli basis. However,F CBC is not merely Clifford circuits with the Pauli basis mapped to the computational basis. The reason is thatUcan only transformOthroughU OU †, the...

    work page

  70. [70]

    22 0 2 4 6 8 10 n:Xn |0 0|10 n inputs 0 2 4 6 8Entropy Space entanglement for T-magic circuit zero circuit BBC circuit CBC circuit FIG

    The reason can be understood from Section E 1, where we show{CCX, CX, S}forms the Clifford structure on computational basis, making a pretty good exploration onF CBC [50]. 22 0 2 4 6 8 10 n:Xn |0 0|10 n inputs 0 2 4 6 8Entropy Space entanglement for T-magic circuit zero circuit BBC circuit CBC circuit FIG. 4. The same setting as Fig 3 except forUinF CBC, ...

    work page