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

Bulletin of the American Physical Society

Path-independent quantum gates: general formalism and algebraic structure

Wen-Long Ma, Liang Jiang

Published Mar 17, 2021• 0 citations
OpenAlex

Related papers

Algebraic structure of path-independent quantum control

Wen-Long Ma, Shu‐Shen Li, Liang Jiang

Path-independent (PI) quantum control has recently been proposed to integrate quantum error correction and quantum control [W.-L. Ma, M. Zhang, Y. Wong, K. Noh, S. Rosenblum, P. Reinhold, R. J. Schoelkopf, and L. Jiang, Phys. Rev. Lett. 125, 110503 (2020)], achieving fault-tolerant quantum gates against ancilla errors. Here we reveal the underlying algebraic structure of PI quantum control. The PI Hamiltonians and propagators turn out to lie in an algebra isomorphic to the ordinary matrix algebra, which we call the PI matrix algebra. The PI matrix algebra, defined on the Hilbert space of a composite system (including an ancilla system and a central system), is isomorphic to the matrix algebra defined on the Hilbert space of the ancilla system. By extending the PI matrix algebra to the Hilbert-Schmidt space of the composite system, we provide an exact and unifying condition for PI quantum control against ancilla noise.

arXiv:2201.00360•Physical Review Research•May 9, 2022•10 citations

Path-independent gates for error-corrected quantum computing: Theory

Wen-Long Ma, Philip Reinhold, Serge Rosenblum +2 more

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Algebraic Formulation of the Operatorial Perturbation Theory. Part I

Ary W. Espinosa Müller, Adelio Matamala-V�squez

A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his formalism. In this regard, it has been introduced a new set of superoperators featured by their algebraic structure. Also, two lemmas and one theorem have been developed in order to algebraically reformulate the theory on more rigorous grounds. Finally, we have been able to build a coherent and self-contained formalism independent on any matricial representation , removing in this way the degeneracy problem .

arXiv:quant-ph/9606011•Jun 12, 1996•2 citations

The Algebraic Structure of an Approximately Universal System of Quantum Computational Gates

María Luisa Dalla Chiara, Roberto Giuntini, Héctor Freytes +2 more

Foundations of Physics•Mar 31, 2009•16 citations

Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial Optimization

Tianen Chen, Yun Shang

The Quantum Approximate Optimization Algorithm (QAOA) follows a single, fixed evolution path, overlooking the potential computational advantage of coherently superposing multiple trajectories. Here we overcome this limitation with a hybrid quantum walk (HQW) ansatz that super poses multiple Hamiltonian-driven paths coherently within each circuit layer via a dynamical coin operator. QAOA emerges as a special case of this framework with a static Pauli-X coin. Using Pontryagin's minimum principle, we derive the optimal form of the coin operator, demonstrating that it generally differs from a constant gate. A dynamical Lie algebra analysis reveals that HQW generates a strictly larger Jordan-Lie algebra, providing an algebraic foundation for its enhanced expressivity. Especially, we reveal the connection between the unique Jordan product negativity in HQW's DLA and its performance advantages. Numerical experiments on Max-Cut and Maximum Independent Set problems show that HQW systematically outperforms QAOA in convergence speed, solution accuracy, and robustness. Our work establishes a path-superposition paradigm for quantum optimization, combining optimal control theory with algebraic structure to guide the design of advanced quantum algorithms.

quant-pharXiv:2604.25760•Apr 29, 2026•0 citations

Quantum Gates and Circuits

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•3 citations
Path-independent (PI) quantum control has recently been proposed to integrate quantum error correction and quantum control [W.-L. Ma, M. Zhang, Y. Wong, K. Noh, S. Rosenblum, P. Reinhold, R. J. Schoelkopf, and L. Jiang, Phys. Rev. Lett. 125, 110503 (2020)], achieving fault-tolerant quantum gates against ancilla errors. Here we reveal the underlying algebraic structure of PI quantum control. The PI Hamiltonians and propagators turn out to lie in an algebra isomorphic to the ordinary matrix algebra, which we call the PI matrix algebra. The PI matrix algebra, defined on the Hilbert space of a composite system (including an ancilla system and a central system), is isomorphic to the matrix algebra defined on the Hilbert space of the ancilla system. By extending the PI matrix algebra to the Hilbert-Schmidt space of the composite system, we provide an exact and unifying condition for PI quantum control against ancilla noise.
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his formalism. In this regard, it has been introduced a new set of superoperators featured by their algebraic structure. Also, two lemmas and one theorem have been developed in order to algebraically reformulate the theory on more rigorous grounds. Finally, we have been able to build a coherent and self-contained formalism independent on any matricial representation , removing in this way the degeneracy problem .
The Quantum Approximate Optimization Algorithm (QAOA) follows a single, fixed evolution path, overlooking the potential computational advantage of coherently superposing multiple trajectories. Here we overcome this limitation with a hybrid quantum walk (HQW) ansatz that super poses multiple Hamiltonian-driven paths coherently within each circuit layer via a dynamical coin operator. QAOA emerges as a special case of this framework with a static Pauli-X coin. Using Pontryagin's minimum principle, we derive the optimal form of the coin operator, demonstrating that it generally differs from a constant gate. A dynamical Lie algebra analysis reveals that HQW generates a strictly larger Jordan-Lie algebra, providing an algebraic foundation for its enhanced expressivity. Especially, we reveal the connection between the unique Jordan product negativity in HQW's DLA and its performance advantages. Numerical experiments on Max-Cut and Maximum Independent Set problems show that HQW systematically outperforms QAOA in convergence speed, solution accuracy, and robustness. Our work establishes a path-superposition paradigm for quantum optimization, combining optimal control theory with algebraic structure to guide the design of advanced quantum algorithms.