Qudit Designs and Where to Find Them

• URL: http://arxiv.org/abs/2603.02659v1
• Date: Tue, 03 Mar 2026 06:49:13 GMT
• Title: Qudit Designs and Where to Find Them
• Authors: Namit Anand, Jeffrey Marshall, Jason Saied, Eleanor Rieffel, Andrea Morello,
• Abstract summary: Unitary t-designs are some of the most versatile tools in quantum information theory.<n>We introduce a technique to construct families of weighted state t-designs in arbitrary qudit dimensions.<n>We also introduce a Clifford character RB that allows us to benchmark the qudit Clifford group in any dimension.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing exponential separations between classical and quantum query complexity. While unitary designs originating from a group structure, such as the Clifford group, have proven to be incredibly useful for qubit systems, unfortunately, this is no longer true for qudits. In fact, the classification of finite-group representations rules out the existence of unitary 2-designs for arbitrary qudit dimensions. This severely limits the applicability of standard quantum information primitives when it comes to qudit systems. We overcome these limitations with a three-fold contribution. First, we introduce a general technique to construct families of weighted state t-designs in arbitrary qudit dimensions. These weighted state-designs generalize classical shadow tomography protocol from qubits to qudits. Second, we introduce a Clifford character RB that allows us to benchmark the qudit Clifford group in any dimension, including non-prime-power dimensions. And third, we establish bounds on the quantum circuit complexity of generating approximate unitary-designs from native gates in existing quantum hardware such as high-spin and cavity-QED qudits. Our work further highlights the analogy between spin and optical coherent states by proving that spin-GKP codewords form a state 2-design while spin coherent states do not; in direct analogy with the optical case. This work is structured as a pedagogical and self-contained introduction to unitary designs and their applications to qudit systems.

Related papers

• Scheme of quantum communications based on Witting polytope [55.2480439325792]
  Presented paper describes how to use this configuration for a quantum key distribution protocol based on contextuality using some illustrative examples with 40 "quantum cards"<n>In a more general case, two arbitrary quantum systems with four basis states (ququarts) can be used instead.
  arXiv  Detail & Related papers  (2025-03-24T08:26:48Z)
• Quantum Circuits for SU(3) Lattice Gauge Theory [0.17988006111525215]
  We consider pure $SU(3)$ gauge theory in two and three spatial dimensions.<n>We build circuits for simulating time evolution on arbitrary lattice volumes.
  arXiv  Detail & Related papers  (2025-03-11T20:13:58Z)
• Preparing Code States via Seed-Entangler-Enriched Sequential Quantum Circuits: Application to Tetra-Digit Topological Error-Correcting Codes [14.058410852202826]
  We introduce a unified and efficient framework of quantum circuits.<n>We construct long-range entangled states (i.e., code states) in code space of topological error-correcting codes.
  arXiv  Detail & Related papers  (2025-03-07T12:32:13Z)
• Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits [0.0]
  We analyse the entanglement structure of states generated by random constant-depth quantum circuits.<n>We prove that macroscopic long-ranged entanglement is generated above some constant critical depth in several natural classes of circuit architectures.
  arXiv  Detail & Related papers  (2024-10-30T17:33:02Z)
• Quantum information with quantum-like bits [0.0]
  We show how arbitrary gates can be implemented by manipulating many-body correlations.<n>This suggests the possibility of quantum-like information processing on a special class of many-body classical systems.
  arXiv  Detail & Related papers  (2024-08-12T20:40:54Z)
• Simulating 2D lattice gauge theories on a qudit quantum computer [2.2246996966725305]
  We present a quantum computation of the properties of the basic building block of two-dimensional lattice quantum electrodynamics. This is made possible by the use of a trapped-ion qudit quantum processor. Qudits are ideally suited for describing gauge fields, which are naturally high-dimensional.
  arXiv  Detail & Related papers  (2023-10-18T17:06:35Z)
• Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits [0.0]
  We show that applying a dual-unitary circuit to a many-body state followed by appropriate measurements effectively implements quantum computation in the spatial direction. Our protocol allows generic quantum circuits to be rotated' in space-time and gives new ways to exchange between resources like qubit number and coherence time in quantum computers.
  arXiv  Detail & Related papers  (2022-09-13T17:46:15Z)
• No-signalling constrains quantum computation with indefinite causal structure [45.279573215172285]
  We develop a formalism for quantum computation with indefinite causal structures. We characterize the computational structure of higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
  arXiv  Detail & Related papers  (2022-02-21T13:43:50Z)
• LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
  This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems. We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
  arXiv  Detail & Related papers  (2021-10-04T12:20:23Z)
• Circuit Complexity in Topological Quantum Field Theory [0.0]
  Quantum circuit complexity has played a central role in advances in holography and many-body physics. In a departure from standard treatments, we aim to quantify the complexity of the Euclidean path integral. We argue that the pants decomposition provides a natural notion of circuit complexity within the category of 2-dimensional bordisms. We use it to formulate the circuit complexity of states and operators in 2-dimensional topological quantum field theory.
  arXiv  Detail & Related papers  (2021-08-30T18:00:00Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Quantum anomalous Hall phase in synthetic bilayers via twistless twistronics [58.720142291102135]
  We propose quantum simulators of "twistronic-like" physics based on ultracold atoms and syntheticdimensions. We show that our system exhibits topologicalband structures under appropriate conditions.
  arXiv  Detail & Related papers  (2020-08-06T19:58:05Z)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)

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.