An efficient algorithm to compute entanglement in states with low magic

• URL: http://arxiv.org/abs/2510.06318v1
• Date: Tue, 07 Oct 2025 18:00:01 GMT
• Title: An efficient algorithm to compute entanglement in states with low magic
• Authors: ChunJun Cao, Gong Cheng, Tianci Zhou,
• Abstract summary: Efficient extraction of entanglement can inform our understanding of dynamical quantum processes.<n>We develop an efficient classical algorithm to compute the von Neumann entropy and entanglement spectrum for such states.
• Score: 11.189994857052634
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A bottleneck for analyzing the interplay between magic and entanglement is the computation of these quantities in highly entangled quantum many-body magic states. Efficient extraction of entanglement can also inform our understanding of dynamical quantum processes such as measurement-induced phase transition and approximate unitary designs. We develop an efficient classical algorithm to compute the von Neumann entropy and entanglement spectrum for such states under the condition that they have low stabilizer nullity. The algorithm exploits the property of stabilizer codes to separate entanglement into two pieces: one generated by the common stabilizer group and the other from the logical state. The low-nullity constraint ensures both pieces can be computed efficiently. Our algorithm can be applied to study the entanglement in sparsely $T$-doped circuits with possible Pauli measurements as well as certain classes of states that have both high entanglement and magic. Combining with stabilizer learning subroutines, it also enables the efficient learning of von Neumann entropies for low-nullity states prepared on quantum devices.

Related papers

• Classical Simulations of Low Magic Quantum Dynamics [0.1666604949258699]
  We develop algorithms for adaptive quantum circuits that produce states with low levels of magic.<n>These algorithms are particularly well-suited to circuits with high rates of Pauli measurements.<n>We study the dynamics of all-to-all monitored quantum circuits with a sub-extensive rate of T-gates per unit of circuit depth.
  arXiv  Detail & Related papers  (2025-08-27T20:17:15Z)
• Learning Feasible Quantum States for Quadratic Constrained Binary Optimization Problems [41.23247424467223]
  We develop a variational approach that creates an equal superposition of quantum states that satisfy constraints in a QCBO.<n>The resulting equal superposition can be used as an initial state for quantum algorithms that solve QUBOs/QCBOs.
  arXiv  Detail & Related papers  (2025-08-04T16:44:53Z)
• An em algorithm for quantum Boltzmann machines [40.40469032705598]
  We develop a quantum version of the em algorithm for training quantum Boltzmann machines.<n>We implement the algorithm on a semi-quantum restricted Boltzmann machine, where quantum effects are confined to the hidden layer.
  arXiv  Detail & Related papers  (2025-07-29T07:59:22Z)
• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Handbook for Quantifying Robustness of Magic [0.0]
  Robustness of magic (RoM) characterizes the degree of usefulness of a given quantum state for non-Clifford operation. We present efficient novel algorithms to compute the RoM. We numerically demonstrate our state-of-the-art results for copies of magic states and partially disentangled quantum states.
  arXiv  Detail & Related papers  (2023-11-02T16:15:00Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Thermodynamic optimization of quantum algorithms: On-the-go erasure of qubit registers [1.5229257192293197]
  "On-the-go erasure" of quantum registers that are no longer needed for a given algorithm. Freezing up auxiliary qubits as they stop being useful would facilitate the parallelization of computations. For the class of algorithms solving the Abelian hidden subgroup problem, we find optimal on-the-go erasure protocols.
  arXiv  Detail & Related papers  (2021-12-08T16:47:16Z)
• Near-term Efficient Quantum Algorithms for Entanglement Analysis [5.453850739960517]
  Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. This work proposes three near-term efficient algorithms exploiting the hybrid quantum-classical technique to address this difficulty.
  arXiv  Detail & Related papers  (2021-09-22T15:15:58Z)
• Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
  Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
  arXiv  Detail & Related papers  (2020-12-03T07:12:08Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.