Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms

• URL: http://arxiv.org/abs/2509.26623v1
• Date: Tue, 30 Sep 2025 17:57:08 GMT
• Title: Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
• Authors: Dmitry Grinko, Satoshi Yoshida,
• Abstract summary: We present a general method for simulating an action of $t$ copies of a Haar random unitary for arbitrary compact groups.<n>It is conceptually simple, exact and utilizes Clebsch-Gordan transforms as main building blocks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a general method for simulating an action of $t$ copies of a Haar random unitary for arbitrary compact groups. This construction can be viewed as a representation-theoretic generalization of Zhandry's compressed function oracle technique. It is conceptually simple, exact and utilizes Clebsch-Gordan transforms as main building blocks. In particular, for the unitary group, our method is efficient in space and time. Finally, our general oracle for forward queries can be easily modified into oracles for conjugate, transpose, and inverse queries, thus unifying all four query types.

Related papers

• Clebsch-Gordan Transformer: Fast and Global Equivariant Attention [19.720202550140325]
  We propose Clebsch-Gordan Transformer, achieving efficient global attention by a novel Clebsch-Gordon Convolution on $SO(3)$ irreducible representations.<n>Our method enables equivariant modeling of features at all orders while achieving $O(N log N)$ input token complexity.<n>We benchmark our method on a diverse set of benchmarks including n-body simulation, QM9, ModelNet point cloud classification and a robotic grasping dataset.
  arXiv  Detail & Related papers  (2025-09-28T22:09:36Z)
• Compressed Permutation Oracles [0.6768558752130311]
  We develop and prove soundness of a compressed permutation oracle.<n>We re-prove essentially all known quantum query lower bounds in the random permutation model.
  arXiv  Detail & Related papers  (2025-09-23T03:13:48Z)
• Permutation Superposition Oracles for Quantum Query Lower Bounds [14.957648729581502]
  We show how to use the resulting oracle simulation to bound the success probability of an algorithm for any predicate on input-output pairs. We show that the one-round sponge construction is unconditionally preimage resistant in the random permutation model.
  arXiv  Detail & Related papers  (2024-07-12T19:27:13Z)
• Accelerated Discovery of Machine-Learned Symmetries: Deriving the Exceptional Lie Groups G2, F4 and E6 [55.41644538483948]
  This letter introduces two improved algorithms that significantly speed up the discovery of symmetry transformations. Given the significant complexity of the exceptional Lie groups, our results demonstrate that this machine-learning method for discovering symmetries is completely general and can be applied to a wide variety of labeled datasets.
  arXiv  Detail & Related papers  (2023-07-10T20:25:44Z)
• Sumformer: Universal Approximation for Efficient Transformers [2.4832703558223725]
  We introduce Sumformer, a novel and simple architecture capable of universally approxingimating sequence-to-sequence functions. We derive a new proof for Transformers, showing that just one attention layer is sufficient for universal approximation.
  arXiv  Detail & Related papers  (2023-07-05T13:59:35Z)
• Approximating a RUM from Distributions on k-Slates [88.32814292632675]
  We find a generalization-time algorithm that finds the RUM that best approximates the given distribution on average. Our theoretical result can also be made practical: we obtain a that is effective and scales to real-world datasets.
  arXiv  Detail & Related papers  (2023-05-22T17:43:34Z)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• SPANet: Generalized Permutationless Set Assignment for Particle Physics using Symmetry Preserving Attention [62.43586180025247]
  Collisions at the Large Hadron Collider produce variable-size sets of observed particles. Physical symmetries of decay products complicate assignment of observed particles to decay products. We introduce a novel method for constructing symmetry-preserving attention networks.
  arXiv  Detail & Related papers  (2021-06-07T18:18:20Z)
• Glushkov's construction for functional subsequential transducers [91.3755431537592]
  Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. Special flavour of regular expressions is introduced, which can be efficiently converted to $epsilon$-free functional subsequential weighted finite state transducers.
  arXiv  Detail & Related papers  (2020-08-05T17:09:58Z)
• Canonical Construction of Quantum Oracles [4.220030262107688]
  A common, but inefficient automation approach is to use oracles with classical evaluation of all the states at circuit design time. We present a novel, canonical way to produce a quantum oracle from an algebraic expression, that maps a set of selected states to the same value, coupled with a simple oracle that matches that particular value. In addition, this paper presents experimental results obtained on real quantum hardware, the new Honeywell computer based on trapped-ion technology with quantum volume 64.
  arXiv  Detail & Related papers  (2020-06-18T16:28:55Z)
• Invariant Feature Coding using Tensor Product Representation [75.62232699377877]
  We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier. A novel feature model that explicitly consider group action is proposed for principal component analysis and k-means clustering.
  arXiv  Detail & Related papers  (2019-06-05T07:15:17Z)

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.