Learning Clifford-structured quantum unitaries and Hamiltonians

• URL: http://arxiv.org/abs/2608.09912v1
• Date: Mon, 10 Aug 2026 17:54:14 GMT
• Title: Learning Clifford-structured quantum unitaries and Hamiltonians
• Abstract summary: Learning algorithms for structured quantum unitaries and Hamiltonians have primarily considered classes of processes that are local or sparse in the Pauli basis.<n>We turn our attention to learning $n$-qubit quantum unitaries $U$ and Hamiltonians $H$, given query access to $U$ or the unitary evolution of $H$, that may be dense in the Pauli basis but still admit concise Clifford decompositions.
• Score: 0.32622301272834514
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Learning algorithms for structured quantum unitaries and Hamiltonians have primarily considered classes of processes that are local or sparse in the Pauli basis. We turn our attention to learning $n$-qubit quantum unitaries $U$ and Hamiltonians $H$, given query access to $U$ or the unitary evolution of $H$, that may be dense in the Pauli basis but still admit concise Clifford decompositions. Specifically, we consider unitaries (or Hamiltonians) of the form $U = \sum_i α_i C_i$ over Cliffords $C_i$ with bounded Clifford extent $\sum_i |α_i|$. To extract this Clifford structure, we introduce an agnostic tomography protocol for Clifford unitaries that given query access to an unknown unitary $U$ with optimal Clifford fidelity $\textsf{opt}$, outputs a Clifford unitary witnessing fidelity $\geq \textsf{opt} - \varepsilon$ for some error $\varepsilon > 0$, in time $\textsf{poly}(n,(1/\varepsilon)^{\log(1/\varepsilon)})$. We then apply this protocol to obtain tomography protocols for unitaries and Hamiltonians that have bounded Clifford extent. This extends learnability of Hamiltonians from those with sparse Pauli decompositions to those that are dense (i.e., has sparsity $Ω(2^n)$) in the Pauli basis but are Clifford structured.

Related papers

• Efficiently learning depth-3 circuits via quantum agnostic boosting [41.9957758385623]
  We study the study of quantum agnostic learning of phase states with respect to a function class $mathsfC$.<n>Our main technical contribution is a quantum boosting protocol which converts a weak learner.<n>Using quantum agnostic boosting, we obtain a $nO(log log n cdot log(1/varepsilon))$-time algorithm for learning $textsfpoly(n)$-sized depth-$3$ circuits.
  arXiv  Detail & Related papers  (2025-09-17T22:28:29Z)
• The non-Clifford cost of random unitaries [0.2796197251957244]
  We explore the ensemble of $t$-doped Clifford circuits on $n$ qubits.<n>We establish rigorous convergence bounds towards unitary $k$-designs.<n>We derive analytic expressions for the operator twirling over the ensemble of random doped Clifford circuits.
  arXiv  Detail & Related papers  (2025-05-15T09:28:10Z)
• Hamiltonian simulation for low-energy states with optimal time dependence [45.02537589779136]
  We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. We present a quantum algorithm that uses $O(tsqrtlambdaGamma + sqrtlambda/Gammalog (1/epsilon))$ queries to the block-encoding for any $Gamma$.
  arXiv  Detail & Related papers  (2024-04-04T17:58:01Z)
• Low-depth Clifford circuits approximately solve MaxCut [44.99833362998488]
  We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. Our algorithm finds an approximate solution of MaxCut on an $N$-vertex graph by building a depth $O(N)$ Clifford circuit.
  arXiv  Detail & Related papers  (2023-10-23T15:20:03Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• The Clifford theory of the n-qubit Clifford group [0.0]
  Recent applications have made use of the representation theory of the Clifford group.<n>We find an unexpected correspondence between irreducible characters of the n-qubit Clifford group and those of the (n+1)-qubit Clifford group.
  arXiv  Detail & Related papers  (2023-07-11T21:21:31Z)
• Learning efficient decoders for quasi-chaotic quantum scramblers [3.823356975862005]
  We show that one can retrieve the scrambled information even without any previous knowledge of the scrambler. A classical decoder can retrieve with fidelity one all the information scrambled by a random unitary. Results show that one can learn the salient properties of quantum unitaries in a classical form.
  arXiv  Detail & Related papers  (2022-12-21T20:19:53Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Low-degree learning and the metric entropy of polynomials [44.99833362998488]
  We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
  arXiv  Detail & Related papers  (2022-03-17T23:52:08Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Unitary Subgroup Testing [8.282602586225831]
  We study problems with the group $mathcalG$ as the trivial subgroup (i.e. identity testing) or the Pauli or Clifford group and their $q$-ary extension. Our main result is an equivalence between Pauli testing, Clifford testing and Identity testing.
  arXiv  Detail & Related papers  (2021-04-08T08:12:25Z)
• Hadamard-free circuits expose the structure of the Clifford group [9.480212602202517]
  The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. We show that any Clifford operator can be uniquely written in the canonical form $F_HSF$. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group.
  arXiv  Detail & Related papers  (2020-03-20T17:51:36Z)
• Efficient unitary designs with a system-size independent number of non-Clifford gates [2.387952453171487]
  It takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group. Unitary $t-designs mimic the Haar-$-th moments. We derive novel bounds on the convergence time of random Clifford circuits to the $t$-th moment of the uniform distribution on the Clifford group.
  arXiv  Detail & Related papers  (2020-02-21T19:41:07Z)

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.