Quick Navigation

Topics

Trapped Ion Quantum Computing

YAQQ: yet another quantum quantizer \\ design space exploration of quantum gate sets using novelty search

Crossref
Authors: Aritra Sarkar, Akash Kundu, Matthew Steinberg, Sibasish Mishra, Sebastiaan Fauquenot, Tamal Acharya, Jaroslaw Miszczak, Sebastian Feld

Year

2026

Paper ID

38710

Status

Peer-reviewed

Abstract Read

~2 min

Abstract Words

285

Citations

0

Abstract

Abstract The standard model of quantum computation is based on quantum circuits, where the number and quality of the quantum gates composing the circuit influence the runtime and fidelity of the computation. The fidelity of the decomposition of quantum algorithms, represented as unitary matrices, to bounded depth quantum circuits depends strongly on the set of gates available for the decomposition routine. To investigate this dependence, we explore the design space of discrete quantum gate sets and present a software tool for comparative analysis of quantum processing units and control protocols based on their native gates. 
The evaluation is conditioned on a set of unitary transformations representing target use cases on the quantum processors. The cost function considers three key factors: (i) the statistical distribution of the decomposed circuits' depth, (ii) the statistical distribution of process fidelities for the approximate decomposition, and (iii) the relative novelty of a gate set compared to other gate sets in terms of the aforementioned properties. The developed software, called YAQQ (Yet Another Quantum Quantizer), enables the discovery of an optimized set of quantum gates through this tunable joint cost function. To identify these gate sets, we use the novelty search algorithm, circuit decomposition techniques (like Solovay-Kitaev, Cartan, and quantum Shannon decomposition), and stochastic optimization to implement YAQQ within the Qiskit quantum simulator environment. YAQQ exploits reachability tradeoffs conceptually derived from quantum algorithmic information theory. Our results demonstrate the pragmatic application of identifying gate sets that are advantageous to popularly used quantum gate sets in representing quantum algorithms. Consequently, we demonstrate pragmatic use cases for YAQQ, including comparing transversal logical gate sets in quantum error correction codes and designing optimal quantum instruction sets for a benchmark suite of quantum algorithms.

Why This Paper Matters

  • This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
  • It adds a 2026 reference point for readers tracking recent quantum research.
  • Abstract The standard model of quantum computation is based on quantum circuits, where the number and quality of the quantum gates composing the circuit influence the runtime...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #38710 #68474 Concentration-Free Quantum Kern... #68470 A fluxonium qubit-based hybrid ... #68469 Pitfalls when tackling the expo... #68467 Hong-Ou-Mandel interference of ...

External citation index: OpenAlex citation signal • updated 2026-06-12 17:06:20

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.