[Paper Review] Jordan-Wigner formalism for classical simulation beyond binary matchgates

Richard Jozsa, Akimasa Miyake|arXiv (Cornell University)|Nov 13, 2013

Quantum Computing Algorithms and Architecture12 references3 citations

TL;DR

This paper extends the Jordan-Wigner formalism to classically simulate a broader class of quantum circuits beyond binary matchgates, including arbitrary single-qubit gates on the first qubit line within matchgate circuits. By leveraging Lie algebra theory and explicit constructions, it demonstrates efficient classical simulation of these extended circuits, generalizing Valiant’s matchgate formalism and making previously abstract results explicit and transparent.

ABSTRACT

The unitary matchgate circuits introduced by Valiant provide an interesting class of quantum circuits that are classically efficiently simulatable. They were shown by Terhal & DiVincenzo and Knill to be related to the physics of non-interacting fermions. The Jordan-Wigner (JW) formalism provides an efficient classical simulation of the latter, which turns out to be equivalent to the restricted case of circuits of binary (2-qubit) matchgates. Valiant's formalism allows further unitary gates: in particular we may include arbitrary 1-qubit gates on the first qubit line at any stage within a binary matchgate circuit. In this note we show how the JW formalism may be extended to provide an efficient classical simulation of such extended circuits, and we show how the simulability also follows from some elementary Lie algebra theory. The essential ingredients have been indicated previously by Knill in a condensed and abstract form, and our purpose is to make these results explicit and transparent.

Motivation & Objective

• To extend the Jordan-Wigner formalism beyond binary matchgates to include arbitrary single-qubit gates on the first qubit line within matchgate circuits.
• To provide a transparent and explicit derivation of classical simulability for this extended class of quantum circuits.
• To show that the extended simulability follows from elementary Lie algebra theory, making previously abstract results in Knill's work more accessible.

Proposed method

• Adapting the Jordan-Wigner transformation to map fermionic systems with non-trivial single-qubit operations to qubit circuits.
• Integrating arbitrary 1-qubit gates on the first qubit line into the matchgate circuit framework while preserving classical simulability.
• Using Lie algebraic structures to formalize the closure properties of the extended gate set under composition.
• Demonstrating that the resulting circuit class remains efficiently simulatable by showing the evolution remains within a solvable algebraic structure.
• Providing explicit circuit transformations that maintain the classical simulation efficiency of the original matchgate framework.
• Reconstructing and clarifying Knill’s abstract results in a more concrete and accessible form for researchers in quantum simulation.

Experimental results

Research questions

• RQ1 Can the Jordan-Wigner formalism be extended to simulate quantum circuits that include arbitrary single-qubit gates on the first qubit line within a matchgate circuit framework?
• RQ2 What algebraic structure underlies the classical simulability of this extended circuit class?
• RQ3 How does the inclusion of non-binary matchgates and arbitrary 1-qubit gates affect the classical simulation efficiency?
• RQ4 Can the simulability of these circuits be derived from elementary Lie algebra theory rather than relying on abstract constructions?
• RQ5 What is the explicit connection between the extended circuit class and non-interacting fermions with additional single-qubit operations?

Key findings

• The Jordan-Wigner formalism can be systematically extended to classically simulate a broader class of quantum circuits that include arbitrary single-qubit gates on the first qubit line within matchgate circuits.
• The extended circuit class remains efficiently simulatable because the underlying evolution lies within a solvable Lie algebra, ensuring classical tractability.
• The classical simulability of these circuits follows from elementary Lie algebra theory, providing a deeper algebraic foundation for the simulation result.
• The paper makes previously condensed and abstract results from Knill’s work explicit and transparent, enabling clearer understanding and application.
• The extension generalizes Valiant’s matchgate formalism beyond binary matchgates while preserving efficient classical simulation, broadening the scope of classically simulatable quantum circuits.