Classically Spoofing System Linear Cross Entropy Score Benchmarking

• URL: http://arxiv.org/abs/2405.00789v1
• Date: Wed, 1 May 2024 18:02:22 GMT
• Title: Classically Spoofing System Linear Cross Entropy Score Benchmarking
• Abstract summary: We show that the System Linear Cross Entropy Score (sXES) is an unsound benchmarking metric. We present a classical algorithm that spoofs sXES for experiments corrupted with noise larger than certain threshold.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, several experimental groups have claimed demonstrations of ``quantum supremacy'' or computational quantum advantage. A notable first claim by Google Quantum AI revolves around a metric called the Linear Cross Entropy Benchmarking (Linear XEB), which has been used in multiple quantum supremacy experiments since. The complexity-theoretic hardness of spoofing Linear XEB has nevertheless been doubtful due to its dependence on the Cross-Entropy Quantum Threshold (XQUATH) conjecture put forth by Aaronson and Gunn, which has been disproven for sublinear depth circuits. In efforts on demonstrating quantum supremacy by quantum Hamiltonian simulation, a similar benchmarking metric called the System Linear Cross Entropy Score (sXES) holds firm in light of the aforementioned negative result due to its fundamental distinction with Linear XEB. Moreover, the hardness of spoofing sXES complexity-theoretically rests on the System Linear Cross-Entropy Quantum Threshold Assumption (sXQUATH), the formal relationship of which to XQUATH is unclear. Despite the promises that sXES offers for future demonstration of quantum supremacy, in this work we show that it is an unsound benchmarking metric. Particularly, we prove that sXQUATH does not hold for sublinear depth circuits and present a classical algorithm that spoofs sXES for experiments corrupted with noise larger than certain threshold.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Sample-efficient benchmarking of shallow all-to-all random quantum circuits [0.0]
  We show that the nonlinear cross-entropy provides a sample-efficient benchmark for shallow-depth random quantum circuits.<n>We also develop a binary classifier based on the notion of heavy output generation that features logarithmic sample complexity at short depth.<n>Our evidence comes from exact analytic expressions for all-to-all Brownian circuit ensembles derived using replica tricks, and numerical simulations.
  arXiv  Detail & Related papers  (2026-05-21T18:00:28Z)
• Classical simulation of free-fermionic dynamics and quantum chemistry with magic input [0.15554979526414522]
  We show that for a class of paired non-Gaussian fermionic states, quantum simulation primitives can be efficiently approximated to additive error under free-fermionic dynamics.
  arXiv  Detail & Related papers  (2026-04-29T15:42:59Z)
• A unified framework for efficient quantum simulation of nonlinear spectroscopy [5.604168730080541]
  We present a unified quantum algorithmic framework for computing $n$-th order nonlinear spectroscopies.<n>We validate the framework on IBM's superconducting quantum processors.<n>Our results establish a practical and scalable pathway for probing complex quantum dynamics on near-term quantum devices.
  arXiv  Detail & Related papers  (2026-04-17T15:34:18Z)
• Hybrid Quantum-Classical Mixture of Experts: Unlocking Topological Advantage via Interference-Based Routing [0.0]
  This paper investigates the potential of Quantum Machine Learning (QML) to address limitations through a novel Hybrid Quantum-Classical Mixture of Experts (QMoE) architecture.<n>We conduct an ablation study using a Quantum Gating Network (Angle) combined with classical experts to isolate the source of quantum advantage.<n> Experimental results on non-linearly separable data, such as the Two Moons dataset, demonstrate that the Quantum Router achieves a significant topological advantage.
  arXiv  Detail & Related papers  (2025-12-25T21:15:34Z)
• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• 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)
• X-arability of mixed quantum states [0.351124620232225]
  We study a unified notion of separability, which we call X-arability. For a subset of pure states X, we say that a mixed quantum state is X-arable if it lies in the convex hull of X. We develop unified tools and provable guarantees for X-arability.
  arXiv  Detail & Related papers  (2024-09-27T17:49:59Z)
• Witnessing Quantum Entanglement Using Resonant Inelastic X-ray Scattering [3.2509613040125878]
  entanglement is a central ingredient in our understanding of quantum many-body systems and an essential resource for quantum technologies. We devise a method to extract the quantum Fisher information (QFI) from non-Hermitian operators and formulate an entanglement witness for resonant inelastic x-ray scattering (RIXS) We find that entanglement is challenging to detect under standard conditions, but that it could be achieved by analyzing the outgoing x-ray polarization or via specific choices of momentum and energy.
  arXiv  Detail & Related papers  (2024-04-08T20:31:41Z)
• A sharp phase transition in linear cross-entropy benchmarking [1.4841630983274847]
  A key question in the theory of XEB is whether it approximates the fidelity of the quantum state preparation. Previous works have shown that the XEB generically approximates the fidelity in a regime where the noise rate per qudit $varepsilon$ satisfies $varepsilon N ll 1$. Here, we show that the breakdown of XEB as a fidelity proxy occurs as a sharp phase transition at a critical value of $varepsilon N$.
  arXiv  Detail & Related papers  (2023-05-08T18:00:05Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis [59.545114016224254]
  Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach. We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
  arXiv  Detail & Related papers  (2022-09-28T17:53:25Z)
• Revealing the finite-frequency response of a bosonic quantum impurity [0.15729203067736902]
  Quantum impurities are ubiquitous in condensed matter physics and constitute the most stripped-down realization of many-body problems. We build a quantum simulator of the boundary sine-Gordon model, a non-trivial bosonic impurity problem. This work opens exciting perspectives for the future such as quantifying quantum entanglement in the vicinity of a quantum critical point.
  arXiv  Detail & Related papers  (2022-08-05T09:13:33Z)
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage [6.019061613604927]
  We present an efficient classical algorithm that, with 1 GPU within 2s, yields high XEB values, namely 2-12% of those obtained in experiments. By identifying and exploiting several vulnerabilities of the XEB, we achieve high XEB values without full simulation of quantum circuits.
  arXiv  Detail & Related papers  (2021-12-03T00:37:10Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

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.