Shallow IQP circuit and graph generation

• URL: http://arxiv.org/abs/2511.05267v1
• Date: Fri, 07 Nov 2025 14:28:56 GMT
• Title: Shallow IQP circuit and graph generation
• Authors: Oriol Balló-Gimbernat, Marcos Arroyo-Sánchez, Paula García-Molina, Adan Garriga, Fernando Vilariño,
• Abstract summary: We introduce shallow instantaneous quantum-time circuits as generative graph models.<n>We study bipartite and ErdHos-R'enyi distributions through simulations and large-scale experiments.
• Score: 37.067444579637076
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce shallow instantaneous quantum polynomial-time (IQP) circuits as generative graph models, using an edge-qubit encoding to map graphs onto quantum states. Focusing on bipartite and Erd\H{o}s-R\'enyi distributions, we study their expressivity and robustness through simulations and large-scale experiments. Noiseless simulations of $28$ qubits ($8$-node graphs) reveal that shallow IQP models can learn key structural features, such as the edge density and bipartite partitioning. On IBM's Aachen QPU, we scale experiments from $28$ to $153$ qubits ($8$-$18$ nodes) in order to characterize performance on real quantum hardware. Local statistics, such as the degree distributions, remain accurate across scales with total variation distances ranging from $0.04$ to $0.20$, while global properties like strict bipartiteness degrade at the largest system sizes ($91$ and $153$ qubits). Notably, spectral bipartivity, a relaxation of strict bipartiteness, remains comparatively robust at higher qubit counts. These results establish practical baselines for the performance of shallow IQP circuits on current quantum hardware and demonstrate that, even without error mitigation, such circuits can learn and reproduce meaningful structural patterns in graph data, guiding future developments in quantum generative modeling for the NISQ era and beyond.

Related papers

• Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era [0.0]
  We introduce a fully quantum graph convolutional architecture designed explicitly for unsupervised learning in the noisy intermediate-scale quantum regime.<n>Our model decomposes message passing into pairwise interactions along graph edges using only hardware-native single- and two-qubit gates.
  arXiv  Detail & Related papers  (2026-02-17T21:17:42Z)
• Coined Quantum Walks on Complex Networks for Quantum Computers [2.2336243882030025]
  In complex networks, the coin and shift operators depend on the varying degrees of the nodes.<n>We implement the circuit using Qmod, a high-level quantum programming language.<n>We execute the proposed circuits on the ibm_torino superconducting quantum processor for Watts-Strogatz models.
  arXiv  Detail & Related papers  (2025-12-18T10:55:55Z)
• 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)
• Quantum Deep Equilibrium Models [1.5853439776721878]
  We present Quantum Deep Equilibrium Models (QDEQ), a training paradigm that learns parameters of a quantum machine learning model. We find that QDEQ is not only competitive with comparable existing baseline models, but also achieves higher performance than a network with 5 times more layers. This demonstrates that the QDEQ paradigm can be used to develop significantly more shallow quantum circuits for a given task.
  arXiv  Detail & Related papers  (2024-10-31T13:54:37Z)
• 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)
• Supervised binary classification of small-scale digit images and weighted graphs with a trapped-ion quantum processor [56.089799129458875]
  We present the results of benchmarking a quantum processor based on trapped $171$Yb$+$ ions.<n>We perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• 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)
• Efficient Mean-Field Simulation of Quantum Circuits Inspired by Density Functional Theory [1.3561290928375374]
  Exact simulations of quantum circuits (QCs) are currently limited to $sim$50 qubits. Here we show simulations of QCs with a method inspired by density functional theory (DFT) Our calculations can predict marginal single-qubit probabilities with over 90% accuracy in several classes of QCs with universal gate sets.
  arXiv  Detail & Related papers  (2022-10-29T02:12:15Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Towards the real-time evolution of gauge-invariant $\mathbb{Z}_2$ and $U(1)$ quantum link models on NISQ Hardware with error-mitigation [0.0]
  We benchmark the real-time dynamics of $mathbbZ$ and $U(1)$ gauge in plaquette models using noisy intermediate scale quantum (NISQ) hardware. We design quantum circuits for models of increasing complexity and measure physical observables such as the return probability to the initial state, and locally conserved charges.
  arXiv  Detail & Related papers  (2021-09-30T12:22:21Z)
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking [0.45823749779393547]
  We provide for the first time quantum circuits that generate exact unitary $t$-designs for any $t$ on an arbitrary number of qubits. We numerically demonstrate that the $2$-RB in one- and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit.
  arXiv  Detail & Related papers  (2021-02-25T01:17:42Z)
• 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.