Proper Learning of Shallow All-to-All Quantum Circuits

• URL: http://arxiv.org/abs/2608.20162v1
• Date: Thu, 20 Aug 2026 15:19:51 GMT
• Title: Proper Learning of Shallow All-to-All Quantum Circuits
• Abstract summary: This work considers a variation on the problem of learning shallow quantum circuits.<n>Given access to the circuit, as well as knowledge of its gate layout, we consider the task of learning the specific gates used in the circuit.<n>We identify a meta-algorithmic framework for learning broad classes of circuits based on iterative local gate inversions at the front and back of the circuit.
• Score: 0.1375062426766416
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work considers a variation on the problem of learning shallow quantum circuits. Given query access to the circuit, as well as knowledge of its gate layout, we consider the task of learning the specific gates used in the circuit, producing an operationally-equivalent circuit matching this structure. Building on recent work for learning Haar random brickwork circuits, we identify a meta-algorithmic framework for learning broad classes of circuits based on iterative local gate inversions at the front and back of the circuit. We apply these techniques to study random, all-to-all, two-local circuits, and provide analytical and numerical evidence that this ensemble undergoes a sharp learnability transition at depth $d^* \sim \log_2 n + \log_2\log_2 n$ in the large size limit, based on an analysis of lightcone growth. These results have implications for recently proposed quantum cryptographic schemes based on the difficulty of circuit learning, though there are important distinctions with respect to our setting that suggest avenues for future study.

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)
• Multilevel Circuit Optimization in Quantum Compilers: A Case Study [0.6954287924634025]
  We explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit.<n>We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation.<n>MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates.
  arXiv  Detail & Related papers  (2025-05-14T12:19:17Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Data Complexity Measures for Quantum Circuits Architecture Recommendation [55.74527632797241]
  Quantum Parametric Circuits are constructed as an alternative to reduce the size of quantum circuits.<n> determining the optimal circuit for a given problem remains an open question.<n>In this work, a quantum circuit recommendation architecture for classification problems is proposed using database complexity measures.
  arXiv  Detail & Related papers  (2025-02-21T01:17:24Z)
• Learning shallow quantum circuits with many-qubit gates [1.879968161594709]
  We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates.<n>We show that the learned unitary circuits can be efficiently synthesized in poly-logarithmic depth.
  arXiv  Detail & Related papers  (2024-10-22T04:48:36Z)
• Testing and Debugging Quantum Circuits [0.65268245109828]
  This paper focuses on three types of circuit blocks: Amplitude Permutation, Phase Modulation, and Amplitude Redistribution circuit blocks. We present a comprehensive unit testing tool (Cirquo) and debug approaches tailored to the unique demands of quantum computing.
  arXiv  Detail & Related papers  (2023-11-30T02:42:58Z)
• CktGNN: Circuit Graph Neural Network for Electronic Design Automation [67.29634073660239]
  This paper presents a Circuit Graph Neural Network (CktGNN) that simultaneously automates the circuit topology generation and device sizing. We introduce Open Circuit Benchmark (OCB), an open-sourced dataset that contains $10$K distinct operational amplifiers. Our work paves the way toward a learning-based open-sourced design automation for analog circuits.
  arXiv  Detail & Related papers  (2023-08-31T02:20:25Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Efficient quantum gate decomposition via adaptive circuit compression [0.0]
  The utilization of parametric two-qubit gates in the circuit design allows us to transform the discrete problem of circuit synthesis into an optimization problem over continuous variables. We implemented the algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools.
  arXiv  Detail & Related papers  (2022-03-08T22:29:31Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36: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.