Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The European Physical Journal D

Synthesis of fast qudit gates by a train of coincident pulses

M. Amniat-Talab, M. Saadati-Niari

Published Sep 1, 2015• 10 citations
Publisher
DOI
10.1140/epjd/e2015-60238-9

Related papers

Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits

Guowu Yang, Fei Xie, Xiaoyu Song +1 more

Lecture notes in computer science•Jan 1, 2006•0 citations

Time optimal synthesis of gates for Markovian open qudits

Killian Lutz, Yannick Privat

Journal de Mathématiques Pures et Appliquées•Oct 21, 2026•0 citations

Fast synthesis of the Fredkin gate via quantum Zeno dynamics

Xiao‐Qiang Shao, Tai-Yu Zheng, Shou Zhang

Quantum Information Processing•Nov 24, 2011•6 citations

Optimal Control and Circuit Synthesis of Quantum Gates

Hyeong-Jin Kim

•Jan 1, 2021•0 citations

QSweep: Pulse-Optimal Single-Qudit Synthesis

Ed Younis, Noah Goss

The synthesis of single-qudit unitaries has mainly been understudied, resulting in inflexible and non-optimal analytical solutions, as well as inefficient and impractical numerical solutions. To address this challenge, we introduce QSweep, a guided numerical synthesizer that produces pulse-optimal single-qudit decompositions for any subspace gateset, outperforming all prior solutions. When decomposing ququart gates, QSweep created circuits 4100x (up to 23500x) faster than QSearch with an average of 7.9 fewer pulses than analytical solutions, resulting in an overall 1.54x and 2.36x improvement in experimental single-qutrit and ququart gate fidelity as measured by randomized benchmarking.

arXiv:2312.09990•IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 28, 2024•2 citations

Synthesis of Quantum Circuits

Philipp Niemann, Robert Wille

SpringerBriefs in physics•Jan 1, 2017•0 citations
The synthesis of single-qudit unitaries has mainly been understudied, resulting in inflexible and non-optimal analytical solutions, as well as inefficient and impractical numerical solutions. To address this challenge, we introduce QSweep, a guided numerical synthesizer that produces pulse-optimal single-qudit decompositions for any subspace gateset, outperforming all prior solutions. When decomposing ququart gates, QSweep created circuits 4100x (up to 23500x) faster than QSearch with an average of 7.9 fewer pulses than analytical solutions, resulting in an overall 1.54x and 2.36x improvement in experimental single-qutrit and ququart gate fidelity as measured by randomized benchmarking.