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:2309.11051 · Quantum Science and Technology

Synthesis of energy-conserving quantum circuits with XY interaction

Ge Bai, Iman Marvian

Published Jun 4, 2024• 0 citations
arXivHTMLPDF

Abstract

Abstract We study quantum circuits constructed from i SWAP gates and, more generally, from the entangling gates that can be realized with the XX + YY interaction alone. Such gates preserve the Hamming weight of states in the computational basis, which means they respect the global U(1) symmetry corresponding to rotations around the z axis. Equivalently, assuming that the intrinsic Hamiltonian of each qubit in the system is the Pauli Z operator, they conserve the total energy of the system. We develop efficient methods for synthesizing circuits realizing any desired energy-conserving unitary using XX + YY interaction with or without single-qubit rotations around the z axis. Interestingly, implementing generic energy-conserving unitaries, such as CCZ and Fredkin gates, with two-local energy-conserving gates requires the use of ancilla qubits. When single-qubit rotations around the z-axis are permitted, our scheme requires only a single ancilla qubit, whereas with the XX+YY interaction alone, it requires two ancilla qubits. In addition to exact realizations, we also consider approximate realizations and show how a general energy-conserving unitary can be synthesized using only a sequence of i SWAP gates and two ancillary qubits, with arbitrarily small error, which can be bounded via the Solovay–Kitaev theorem. Our methods are also applicable for synthesizing energy-conserving unitaries when, rather than the XX + YY interaction, one has access to any other energy-conserving two-body interaction that is not diagonal in the computational basis, such as the Heisenberg exchange interaction. We briefly discuss the applications of these circuits in the context of quantum computing, quantum thermodynamics, and quantum clocks.

DOI
10.1088/2058-9565/ad53fa

Related papers

Universal quantum computation by the unitary control of ancilla qubits and using a fixed ancilla-register interaction

Timothy J Proctor, Erika Andersson, Viv M. Kendon

We characterize a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [Phys. Rev. A 82, 020301(R) (2010)], but does not require measurements of the ancillas, and in this respect is similar to the original gate-based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to swap combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite, and fault-tolerant gate set for universal quantum computation in this model.

arXiv:1307.6095•Physical Review A•Oct 24, 2013•13 citations

Minimal ancilla-controlled quantum computation

Timothy J Proctor, Erika Andersson, Viv M. Kendon

We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [PRA 82, 020301(R), 2010], but does not require measurements of the ancillas, and in this respect is similar to the original gate based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to SWAP combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite and fault tolerant gate set for universal quantum computation in this model.

•Jul 23, 2013•0 citations

Rotationally Invariant Circuits: Universality with the Exchange Interaction and Two Ancilla Qubits

Iman Marvian, Hanqing Liu, Austin Hulse

Universality of local unitary transformations is one of the cornerstones of quantum computing with many applications and implications that go beyond this field. However, it has recently been shown that this universality does not hold in the presence of continuous symmetries: generic symmetric unitaries on a composite system cannot be implemented, even approximately, using local symmetric unitaries on the subsystems. In this Letter, we show that, despite these constraints, any SU(2) rotationally invariant unitary can be realized with the Heisenberg exchange interaction, which is 2-local and rotationally invariant, provided that the system interacts with a pair of ancilla qubits. We also show that a single ancilla is not enough to achieve universality. Furthermore, we study qubit circuits formed from k-local rotationally invariant unitaries and fully characterize the constraints imposed by locality on the realizable unitaries. We also find an interpretation of these constraints in terms of the average energy of states with a fixed angular momentum.

arXiv:2202.01963•Physical Review Letters•Mar 29, 2024•13 citations

Approximate quantum circuit synthesis using block encodings

Daan Camps, Roel Van Beeumen

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. We show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

arXiv:2007.01417•Physical Review A•Nov 11, 2020•33 citations

Theory of quantum circuits with Abelian symmetries

Iman Marvian

Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed-matter theory and quantum thermodynamics. However, despite their widespread use, fundamental properties of such circuits are not well understood. Recently, it was found that generic unitaries respecting a global symmetry cannot be realized, even approximately, using gates that respect the same symmetry. This observation raises important open questions: What unitary transformations can be realized with k -local gates that respect a global symmetry? In other words, in the presence of a global symmetry, how does the locality of interactions constrain the possible time evolution of a composite system? In this work, we address these questions for the case of Abelian (commutative) symmetries and develop constructive methods for synthesizing circuits with such symmetries. Remarkably, as a corollary, we find that, while the locality of interactions still imposes additional constraints on realizable unitaries, certain restrictions observed in the case of non-Abelian symmetries do not apply to circuits with Abelian symmetries. For instance, in circuits with a general non-Abelian symmetry such as SU ( d ) , the unitary realized in a subspace with one irreducible representation (charge) of the symmetry dictates the realized unitaries in multiple other sectors with inequivalent representations of the symmetry. Furthermore, in certain sectors, rather than all unitaries respecting the symmetry, the realizable unitaries are the symplectic or orthogonal subgroups of this group. We prove that none of these restrictions appears in the case of Abelian symmetries. This result suggests that global non-Abelian symmetries may affect the thermalization of quantum systems in ways not possible under Abelian symmetries. Published by the American Physical Society 2024

arXiv:2302.12466•Physical Review Research•Dec 18, 2024•15 citations

Optimal ancilla-free Pauli+V circuits for axial rotations

Andreas R. Blass, Alex Bocharov, Yuri G. Gurevich

We address the problem of optimal representation of single-qubit rotations in a certain unitary basis consisting of the so-called V gates and Pauli matrices. The V matrices were proposed by Lubotsky, Philips, and Sarnak [Commun. Pure Appl. Math. 40, 401–420 (1987)] as a purely geometric construct in 1987 and recently found applications in quantum computation. They allow for exceptionally simple quantum circuit synthesis algorithms based on quaternionic factorization. We adapt the deterministic-search technique initially proposed by Ross and Selinger to synthesize approximating Pauli+V circuits of optimal depth for single-qubit axial rotations. Our synthesis procedure based on simple SL2(ℤ) geometry is almost elementary.

arXiv:1412.1033•Journal of Mathematical Physics•Dec 1, 2015•15 citations
Abstract We study quantum circuits constructed from i SWAP gates and, more generally, from the entangling gates that can be realized with the XX + YY interaction alone. Such gates preserve the Hamming weight of states in the computational basis, which means they respect the global U(1) symmetry corresponding to rotations around the z axis. Equivalently, assuming that the intrinsic Hamiltonian of each qubit in the system is the Pauli Z operator, they conserve the total energy of the system. We develop efficient methods for synthesizing circuits realizing any desired energy-conserving unitary using XX + YY interaction with or without single-qubit rotations around the z axis. Interestingly, implementing generic energy-conserving unitaries, such as CCZ and Fredkin gates, with two-local energy-conserving gates requires the use of ancilla qubits. When single-qubit rotations around the z-axis are permitted, our scheme requires only a single ancilla qubit, whereas with the XX+YY interaction alone, it requires two ancilla qubits. In addition to exact realizations, we also consider approximate realizations and show how a general energy-conserving unitary can be synthesized using only a sequence of i SWAP gates and two ancillary qubits, with arbitrarily small error, which can be bounded via the Solovay–Kitaev theorem. Our methods are also applicable for synthesizing energy-conserving unitaries when, rather than the XX + YY interaction, one has access to any other energy-conserving two-body interaction that is not diagonal in the computational basis, such as the Heisenberg exchange interaction. We briefly discuss the applications of these circuits in the context of quantum computing, quantum thermodynamics, and quantum clocks.
We characterize a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [Phys. Rev. A 82, 020301(R) (2010)], but does not require measurements of the ancillas, and in this respect is similar to the original gate-based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to swap combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite, and fault-tolerant gate set for universal quantum computation in this model.
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is required to the computational register and the dynamics of both the register and ancilla are unitary. This scheme is inspired by the measurement-based ancilla-driven quantum computation of Anders et al. [PRA 82, 020301(R), 2010], but does not require measurements of the ancillas, and in this respect is similar to the original gate based model of quantum computation. We consider what possible forms this ancilla-register interaction can take, with a proof that the interaction is necessarily locally equivalent to SWAP combined with an entangling controlled gate. We further show which Hamiltonians can create such interactions and discuss two examples; the two-qubit XY Hamiltonian and a particular case of the XXZ Hamiltonian. We then give an example of a simple, finite and fault tolerant gate set for universal quantum computation in this model.
Universality of local unitary transformations is one of the cornerstones of quantum computing with many applications and implications that go beyond this field. However, it has recently been shown that this universality does not hold in the presence of continuous symmetries: generic symmetric unitaries on a composite system cannot be implemented, even approximately, using local symmetric unitaries on the subsystems. In this Letter, we show that, despite these constraints, any SU(2) rotationally invariant unitary can be realized with the Heisenberg exchange interaction, which is 2-local and rotationally invariant, provided that the system interacts with a pair of ancilla qubits. We also show that a single ancilla is not enough to achieve universality. Furthermore, we study qubit circuits formed from k-local rotationally invariant unitaries and fully characterize the constraints imposed by locality on the realizable unitaries. We also find an interpretation of these constraints in terms of the average energy of states with a fixed angular momentum.
One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. We show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.
Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed-matter theory and quantum thermodynamics. However, despite their widespread use, fundamental properties of such circuits are not well understood. Recently, it was found that generic unitaries respecting a global symmetry cannot be realized, even approximately, using gates that respect the same symmetry. This observation raises important open questions: What unitary transformations can be realized with k -local gates that respect a global symmetry? In other words, in the presence of a global symmetry, how does the locality of interactions constrain the possible time evolution of a composite system? In this work, we address these questions for the case of Abelian (commutative) symmetries and develop constructive methods for synthesizing circuits with such symmetries. Remarkably, as a corollary, we find that, while the locality of interactions still imposes additional constraints on realizable unitaries, certain restrictions observed in the case of non-Abelian symmetries do not apply to circuits with Abelian symmetries. For instance, in circuits with a general non-Abelian symmetry such as SU ( d ) , the unitary realized in a subspace with one irreducible representation (charge) of the symmetry dictates the realized unitaries in multiple other sectors with inequivalent representations of the symmetry. Furthermore, in certain sectors, rather than all unitaries respecting the symmetry, the realizable unitaries are the symplectic or orthogonal subgroups of this group. We prove that none of these restrictions appears in the case of Abelian symmetries. This result suggests that global non-Abelian symmetries may affect the thermalization of quantum systems in ways not possible under Abelian symmetries. Published by the American Physical Society 2024
We address the problem of optimal representation of single-qubit rotations in a certain unitary basis consisting of the so-called V gates and Pauli matrices. The V matrices were proposed by Lubotsky, Philips, and Sarnak [Commun. Pure Appl. Math. 40, 401–420 (1987)] as a purely geometric construct in 1987 and recently found applications in quantum computation. They allow for exceptionally simple quantum circuit synthesis algorithms based on quaternionic factorization. We adapt the deterministic-search technique initially proposed by Ross and Selinger to synthesize approximating Pauli+V circuits of optimal depth for single-qubit axial rotations. Our synthesis procedure based on simple SL2(ℤ) geometry is almost elementary.