Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders

• URL: http://arxiv.org/abs/2602.15180v1
• Date: Mon, 16 Feb 2026 20:38:26 GMT
• Title: Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
• Authors: Vishnu Iyer, Siddhartha Jain, Stephen Jordan, Rolando Somma,
• Abstract summary: We present efficient quantum circuits that implement high-dimensional unitary irreducible representations (irreps) of $SU(n)$.<n>Our circuits can be used to construct explicit Ramanujan quantum expanders, a longstanding open problem.
• Score: 0.945747217338747
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present efficient quantum circuits that implement high-dimensional unitary irreducible representations (irreps) of $SU(n)$, where $n \ge 2$ is constant. For dimension $N$ and error $ε$, the number of quantum gates in our circuits is polynomial in $\log(N)$ and $\log(1/ε)$. Our construction relies on the Jordan-Schwinger representation, which allows us to realize irreps of $SU(n)$ in the Hilbert space of $n$ quantum harmonic oscillators. Together with a recent efficient quantum Hermite transform, which allows us to map the computational basis states to the eigenstates of the quantum harmonic oscillator, this allows us to implement these irreps efficiently. Our quantum circuits can be used to construct explicit Ramanujan quantum expanders, a longstanding open problem. They can also be used to fast-forward the evolution of certain quantum systems.

Related papers

• Random dilation superchannel [0.0]
  We present a quantum circuit that implements the random dilation superchannel.<n>We show an efficient storage-and-retrieval of an unknown quantum channel.
  arXiv  Detail & Related papers  (2025-12-24T16:09:38Z)
• Strong random unitaries and fast scrambling [37.03163411089211]
  We show that strong unitary designs can form in circuit depth $O(log2 n)$ in circuits composed of independent two-qubit Haar-random gates.<n>Our results provide an operational proof of the fast scrambling conjecture from black hole physics.
  arXiv  Detail & Related papers  (2025-09-30T14:23:46Z)
• Shallow quantum circuit for generating O(1)-entangled approximate state designs [6.161617062225404]
  We find a new ensemble of quantum states that serve as an $epsilon$-approximate state $t$-design while possessing extremely low entanglement, magic, and coherence.<n>These resources can reach their theoretical lower bounds, $Omega(log (t/epsilon))$, which are also proven in this work.<n>A class of quantum circuits proposed in our work offers reduced cost for classical simulation of random quantum states.
  arXiv  Detail & Related papers  (2025-07-23T18:56:19Z)
• Nearly Optimal Circuit Size for Sparse Quantum State Preparation [0.0]
  A quantum state is said to be $d$-sparse if it has only $d$ non-zero amplitudes.<n>We prove for the first time a trade-off between the number of ancillary qubits and the circuit size.
  arXiv  Detail & Related papers  (2024-06-23T15:28:20Z)
• Many-body quantum register for a spin qubit [31.114245664719455]
  We demonstrate a functional quantum register in a semiconductor quantum dot. Our work establishes how many-body physics can add step-change functionality to quantum devices.
  arXiv  Detail & Related papers  (2024-04-30T16:13:01Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Fast pseudorandom quantum state generators via inflationary quantum gates [3.5072186061740904]
  We propose a mechanism for reaching pseudorandom quantum states, computationally indistinguishable from Haar random, with shallow log-n depth quantum circuits. We prove that IQ-gates cannot be implemented with 2-qubit gates, but can be realized either as a subset of 2-qudit-gates in $U(d2)$ with $dge 3$ and $d$ prime, or as special 3-qubit gates.
  arXiv  Detail & Related papers  (2023-04-19T18:00:01Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Optimal (controlled) quantum state preparation and improved unitary synthesis by quantum circuits with any number of ancillary qubits [20.270300647783003]
  Controlled quantum state preparation (CQSP) aims to provide the transformation of $|irangle |0nrangle to |irangle |psi_irangle $ for all $iin 0,1k$ for the given $n$-qubit states. We construct a quantum circuit for implementing CQSP, with depth $Oleft(n+k+frac2n+kn+k+mright)$ and size $Oleft(2n+kright)$
  arXiv  Detail & Related papers  (2022-02-23T04:19:57Z)
• Straddling-gates problem in multipartite quantum systems [20.428960719376164]
  We study a variant of quantum circuit complexity, the binding complexity. We show that any $m$partite Schmidt decomposable state has binding complexity linear in $m$, which hints its multi-separable property.
  arXiv  Detail & Related papers  (2021-10-13T16:28:12Z)
• Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis [24.555887999356646]
  The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available. In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare $psi_vrangle$ in depth. Our circuits are deterministic, prepare the state and carry out the unitary precisely, utilize the ancillary qubits tightly and the depths are optimal in a wide range of parameter regime.
  arXiv  Detail & Related papers  (2021-08-13T09:47:11Z)
• Sample Complexity of Learning Quantum Circuits [4.329298109272386]
  We prove that physical quantum circuits are PAC learnable on a quantum computer via empirical risk minimization. Our results provide a valuable guide for quantum machine learning in both theory and experiment.
  arXiv  Detail & Related papers  (2021-07-19T18:00:04Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions [0.0]
  We show that $1D$ random quantum circuits have a spectral gap scaling as $Omega(n-1)$, provided that $t$ is small compared to the local dimension: $t2leq O(q)$. Our second result is an unconditional spectral gap bounded below by $Omega(n-1log-1(n) t-alpha(q))$ for random quantum circuits with all-to-all interactions.
  arXiv  Detail & Related papers  (2020-12-09T19:00:50Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.