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

arXiv:1711.09765 · International Journal of Theoretical Physics

A Matrix Representation of Quantum Circuits over Non-Adjacent Qudits

Giuseppe Sergioli

Published Feb 18, 2019• 4 citations
arXivHTMLPDF
DOI
10.1007/s10773-019-04051-5

Related papers

An Efficient Method for Generating Matrices of Quantum Logic Circuits

Zhiqiang Li, Jiajia Hu, Xi Wu +3 more

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

Matrix-based algorithm for 4-Qubit reversible circuits synthesis

Dong Wang, Shengyao Sun, Hanwu Chen

The mathematical model of the quantum reversible circuits is unitary matrix. Matrix can better reflect the quantum state evolution and further reflect the physical properties of the quantum computation. Matrix transformation based algorithm for 4-qubit reversible logic circuits synthesis is proposed in this paper. The algorithm skillfully uses the matrix representation of the quantum circuit and the circuit of the adjacent matrix to construct 4-qubit circuit with lower cost.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 13, 2013•0 citations

Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data

Robert J. Banks, Arianna Crippa, Matthias Traube +3 more

Parameterized Instantaneous Quantum Polynomial (IQP) circuits have proven useful in quantum generative learning models, particularly for binary distributions. However, when applied to non-binary datasets, they exhibit notable limitations: mapping integer values into qubit-compatible binary representations often destroys the original metric structure of the data. In this paper we aim to extend them to a qudits formulation operating on an integer mapping of the data. The IQP quantum circuit is adapted to encode each integer valued pixel into a bit-string of fixed length and quantum gates are transformed to follow the qudit formalism. As a generative machine learning approach, a suitable loss function for the circuit training and the calculation of the covariance matrix among features are developed and validated on the energy deposits from single-particle electron showers in the electromagnetic calorimeter of the CLIC detector. The method proposed in this work can be also extended to other applications that utilize quantum generative machine learning for non-binary data.

quant-pharXiv:2606.28236•Jun 29, 2026•4 citations

Efficient quantum circuits for qudits

Gavin K. Brennen, Stephen S. Bullock, Dianne Prost O’Leary

Bulletin of the American Physical Society•Mar 24, 2005•0 citations

A framework for semi-universality: Semi-universality of 3-qudit SU(d)-invariant gates

Austin Hulse, Liu, Hanqing, Iman Marvian

Quantum circuits with symmetry-respecting gates have attracted broad interest in quantum information science. While recent work has developed a theory for circuits with Abelian symmetries, revealing important distinctions between Abelian and non-Abelian cases, a comprehensive framework for non-Abelian symmetries has been lacking. In this work, we develop novel techniques and a powerful framework that is particularly useful for understanding circuits with non-Abelian symmetries. Using this framework we settle an open question on quantum circuits with SU(d) symmetry. We show that 3-qudit SU(d)-invariant gates are semi-universal, i.e., generate all SU(d)-invariant unitaries, up to certain constraints on the relative phases between sectors with inequivalent representation of symmetry. Furthermore, we prove that these gates achieve full universality when supplemented with 3 ancilla qudits. Interestingly, we find that studying circuits with 3-qudit gates is also useful for a better understanding of circuits with 2-qudit gates. In particular, we establish that even though 2-qudit SU(d)-invariant gates are not themselves semi-universal, they become universal with at most 11 ancilla qudits. Additionally, we investigate the statistical properties of circuits composed of random SU(d)-invariant gates. Our findings reveal that while circuits with 2-qudit gates do not form a 2-design for the Haar measure over SU(d)-invariant unitaries, circuits with 3-qudit gates generate a t-design, with t that is quadratic in the number of qudits.

arXiv:2407.21249•Jul 30, 2024•17 citations

An efficient quantum circuit analyser on qubits and qudits

T. Loke, Jingbo B. Wang

arXiv:1201.3538•Computer Physics Communications•Jun 25, 2011•6 citations
Parameterized Instantaneous Quantum Polynomial (IQP) circuits have proven useful in quantum generative learning models, particularly for binary distributions. However, when applied to non-binary datasets, they exhibit notable limitations: mapping integer values into qubit-compatible binary representations often destroys the original metric structure of the data. In this paper we aim to extend them to a qudits formulation operating on an integer mapping of the data. The IQP quantum circuit is adapted to encode each integer valued pixel into a bit-string of fixed length and quantum gates are transformed to follow the qudit formalism. As a generative machine learning approach, a suitable loss function for the circuit training and the calculation of the covariance matrix among features are developed and validated on the energy deposits from single-particle electron showers in the electromagnetic calorimeter of the CLIC detector. The method proposed in this work can be also extended to other applications that utilize quantum generative machine learning for non-binary data.
Quantum circuits with symmetry-respecting gates have attracted broad interest in quantum information science. While recent work has developed a theory for circuits with Abelian symmetries, revealing important distinctions between Abelian and non-Abelian cases, a comprehensive framework for non-Abelian symmetries has been lacking. In this work, we develop novel techniques and a powerful framework that is particularly useful for understanding circuits with non-Abelian symmetries. Using this framework we settle an open question on quantum circuits with SU(d) symmetry. We show that 3-qudit SU(d)-invariant gates are semi-universal, i.e., generate all SU(d)-invariant unitaries, up to certain constraints on the relative phases between sectors with inequivalent representation of symmetry. Furthermore, we prove that these gates achieve full universality when supplemented with 3 ancilla qudits. Interestingly, we find that studying circuits with 3-qudit gates is also useful for a better understanding of circuits with 2-qudit gates. In particular, we establish that even though 2-qudit SU(d)-invariant gates are not themselves semi-universal, they become universal with at most 11 ancilla qudits. Additionally, we investigate the statistical properties of circuits composed of random SU(d)-invariant gates. Our findings reveal that while circuits with 2-qudit gates do not form a 2-design for the Haar measure over SU(d)-invariant unitaries, circuits with 3-qudit gates generate a t-design, with t that is quadratic in the number of qudits.