Quantum Phase Classification of Rydberg Atom Systems Using Resource-Efficient Variational Quantum Circuits and Classical Shadows

• URL: http://arxiv.org/abs/2510.23489v1
• Date: Mon, 27 Oct 2025 16:25:16 GMT
• Title: Quantum Phase Classification of Rydberg Atom Systems Using Resource-Efficient Variational Quantum Circuits and Classical Shadows
• Abstract summary: We present a quantum machine learning approach combining classical shadow tomography with variational quantum circuits.<n>We show that minimal quantum resources suffice for high-accuracy phase classification.<n>This work establishes pathways for quantum-enhanced condensed matter physics on near-term quantum devices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum phase transitions in Rydberg atom arrays present significant opportunities for studying many-body physics, yet distinguishing between different ordered phases without explicit order parameters remains challenging. We present a resource-efficient quantum machine learning approach combining classical shadow tomography with variational quantum circuits (VQCs) for binary phase classification of Z2 and Z3 ordered phases. Our pipeline processes 500 randomized measurements per 51-atom chain state, reconstructs shadow operators, performs PCA dimensionality reduction (514 features), and encodes features using angle embedding onto a 2-qubit parameterized circuit. The circuit employs RY-RZ angle encoding, strong entanglement via all-to-all CZ gates, and a minimal 2-parameter ansatz achieving depth 7. Training via simultaneous perturbation stochastic approximation (SPSA) with hinge loss converged in 120 iterations. The model achieved 100% test accuracy with perfect precision, recall, and F1 scores, demonstrating that minimal quantum resources suffice for high-accuracy phase classification. This work establishes pathways for quantum-enhanced condensed matter physics on near-term quantum devices.

Related papers

• Q-DIVER: Integrated Quantum Transfer Learning and Differentiable Quantum Architecture Search with EEG Data [2.666639770148834]
  We propose Q-DIVER, a hybrid framework combining a large-scale pretrained EEG encoder (DIVER-1) with a differentiable quantum classifier.<n>We employ Differentiable Quantum Architecture Search to autonomously discover task-optimal circuit topologies during end-to-end fine-tuning.<n>These results validate quantum transfer learning as a parameter-efficient strategy for high-dimensional biological signal processing.
  arXiv  Detail & Related papers  (2026-03-30T07:37:53Z)
• Preparing 100-qubit symmetry-protected topological order on a digital quantum computer [0.0]
  Demonstrating symmetry-protected quantum matter at scale is a key milestone in using quantum hardware to probe emergent many-body phenomena.<n>Here we use a tensor network based approximate quantum compiling (AQC) protocol to construct shallow quantum circuits.<n>The resulting states exhibit all defining signatures of SPT order including non-local string order for strings of up to length 20, characteristic degeneracies in the entanglement spectrum and clear evidence of symmetry-protected edge modes.
  arXiv  Detail & Related papers  (2026-03-06T14:27:20Z)
• Quantum Data Learning of Topological-to-Ferromagnetic Phase Transitions in the 2+1D Toric Code Loop Gas Model [4.7898251057059795]
  Quantum data learning (QDL) provides a framework for extracting physical insights directly from quantum states.<n>Here, we apply QDL techniques to the 2+1-dimensional toric-code loop-gas model in a magnetic field.
  arXiv  Detail & Related papers  (2025-11-20T23:21:15Z)
• Variational preparation of normal matrix product states on quantum computers [0.3173119584173978]
  We show that matrix product states can be prepared with shallow circuits on quantum computers.<n>We use ADAPT-AQC, an adaptive-ansatz preparation algorithm, and introduce a generalised initialisation procedure for the existing AQC-Tensor algorithm.<n>Our results demonstrate how the integration of quantum and classical resources can push the boundary of what can be studied on quantum computers.
  arXiv  Detail & Related papers  (2025-03-12T18:00:00Z)
• Enhancing the accuracy and efficiency of sample-based quantum diagonalization with phaseless auxiliary-field quantum Monte Carlo [0.0]
  We show that a non-perturbative approach, phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) can recover a substantial amount of correlation energy.<n> Extrapolation of the ph-AFQMC energy versus the energy variance of the SQD trial wavefunctions has the potential to further improve the energy accuracy.
  arXiv  Detail & Related papers  (2025-03-07T22:38:22Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Unveiling quantum phase transitions from traps in variational quantum algorithms [0.0]
  We introduce a hybrid algorithm that combines quantum optimization with classical machine learning.<n>We use LASSO for identifying conventional phase transitions and the Transformer model for topological transitions.<n>We validated the method with numerical simulations and real-hardware experiments on Rigetti's Ankaa 9Q-1 quantum computer.
  arXiv  Detail & Related papers  (2024-05-14T09:01:41Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering [38.02852247910155]
  A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns. We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor. We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T14:02:45Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer [0.0]
  Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. Inspired by data-loading circuits developed for quantum machine learning, we propose an alternate paradigm that provides shallower, yet scalable $mathcalO(d log2N)$ two-qubit gate depth circuits to prepare such states with d-fermions.
  arXiv  Detail & Related papers  (2023-01-18T12:43:18Z)
• Quantum Simulation of Quantum Phase Transitions Using the Convex Geometry of Reduced Density Matrices [0.0]
  We present a general quantum-computing approach to quantum phase transitions. The origin of phase transitions can be understood geometrically in terms of the set of two-particle reduced density matrices (2-RDMs) We compute the convex set of 2-RDMs for a Lipkin-Meshkov-Glick spin model on IBM superconducting-qubit quantum processors.
  arXiv  Detail & Related papers  (2022-07-27T00:30:33Z)
• Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator [41.74498230885008]
  We demonstrate a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms. We benchmark the system by creating and characterizing high-fidelity antiferromagnetically ordered states. We then create and study several new quantum phases that arise from the interplay between interactions and coherent laser excitation.
  arXiv  Detail & Related papers  (2020-12-22T19:00:04Z)

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.