Quantum Dark Magic: Efficiency of Intermediate Non-Stabiliserness

• URL: http://arxiv.org/abs/2507.16543v1
• Date: Tue, 22 Jul 2025 12:52:11 GMT
• Title: Quantum Dark Magic: Efficiency of Intermediate Non-Stabiliserness
• Authors: Tom Krüger, Wolfgang Mauerer,
• Abstract summary: We present an approach to track the behaviour of non-stabiliserness across various algorithms.<n>We find different efficiency in the use of non-stabiliserness for structured and unstructured variational approaches.
• Score: 3.9857517408503567
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: While superiority of quantum over classical computation has been established, the repertoire of primitives with proven or conjectured quantum advantage remains limited. Despite considerable progress in delineating the quantumclassical divide, the systematic construction of algorithms with quantum advantage remains challenging, which can be attributed to a still incomplete understanding of the sources of quantum computational power. While intermediate non-stabiliserness (i.e., traversal of states outside the Clifford orbit) indicates necessary non-classical behaviour for quantum advantage, naively equating non-stabiliserness and non-classicality is misguided: Even random Haar sampled states exhibit near-maximal non-stabiliserness. Advancing towards quantum advantage calls for a better understanding of the efficient use of non-stabiliser states. We present an approach to track the behaviour of non-stabiliserness across various algorithms by pairing resource theory of non-stabiliser entropies with the geometry of quantum state evolution, and introduce permutation agnostic distance measures that reveal non-stabiliser effects previously hidden by a subset of Clifford operations. We find different efficiency in the use of non-stabiliserness for structured and unstructured variational approaches, and show that greater freedom for classical optimisation in quantum-classical methods increases unnecessary non-stabiliser consumption. Our results open new means of analysing the efficient utilisation of quantum resources, and contribute towards the targeted construction of algorithmic quantum advantage.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Role of Nonstabilizerness in Quantum Optimization [0.0]
  We investigate the resource requirements of the Quantum Approximate Optimization Algorithm (QAOA)<n>We show that the nonstabilizerness in QAOA increases with circuit depth before it reaches a maximum, to fall again during the approach to the final solution state.<n>We find curves corresponding to different depths to collapse under a simple rescaling, and we reveal a nontrivial relationship between the final nonstabilizerness and the success probability.
  arXiv  Detail & Related papers  (2025-05-22T18:00:03Z)
• Quantum enhanced Markov chains require fine-tuned quenches [0.0]
  Quantum-enhanced Markov chain Monte Carlo is proposed as a method for robust quantum speedup on imperfect quantum devices. We identify competing factors that limit the algorithm's performance. Specifically, we show that in the long-time limit, the gap of the Markov chain is bounded by the inverse participation ratio of the classical states in the eigenstate basis.
  arXiv  Detail & Related papers  (2024-08-15T01:40:07Z)
• Enhancement of non-Stabilizerness within Indefinite Causal Order [6.612068248407539]
  The quantum SWITCH allows quantum states to pass through operations in a superposition of different orders, outperforming traditional circuits in numerous tasks. We find that the completely stabilizer-preserving operations, which cannot generate magic states under standard conditions, can be transformed to do so when processed by the quantum SWITCH. These findings reveal the unique properties of the quantum SWITCH and open avenues in research on nonstabilizer resources of general quantum architecture.
  arXiv  Detail & Related papers  (2023-11-27T02:35:48Z)
• Limitations of Classically-Simulable Measurements for Quantum State Discrimination [7.0937306686264625]
  stabilizer operations play a pivotal role in fault-tolerant quantum computing. We investigate the limitations of classically-simulable measurements in distinguishing quantum states.
  arXiv  Detail & Related papers  (2023-10-17T15:01:54Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Quantum-Enhanced Greedy Combinatorial Optimization Solver [12.454028945013924]
  We introduce an iterative quantum optimization algorithm to solve optimization problems. We implement the quantum algorithm on a programmable superconducting quantum system using up to 72 qubits. We find the quantum algorithm systematically outperforms its classical greedy counterpart, signaling a quantum enhancement.
  arXiv  Detail & Related papers  (2023-03-09T18:59:37Z)
• Applying classical control techniques to quantum systems: entanglement versus stability margin and other limitations [0.0]
  Development of robust quantum control has been challenging. There are numerous obstacles to applying classical robust control to quantum system. It remains difficult to extract physical insight when classical robust control tools are applied to these systems.
  arXiv  Detail & Related papers  (2022-07-25T17:52:01Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

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.