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:2111.00510

Vertex Lattice Models Simulated with Quantum Circuits

Jechiel van Dijk, Emil V. Prodan

Published Oct 31, 2021• 0 citations
arXivHTMLPDF

Abstract

Classical planar vertex models afford transfer matrices with real and positive entries, which makes this class of models suitable for quantum simulations. In this work, we support this statement by building explicit quantum circuits that implement the actions of the transfer matrices on arbitrary many-qubit states. The number of qubits and the depth of the circuits grow linearly with the size of the system. Furthermore, we present tests using quantum simulators and demonstrate that important physical quantities can be extracted, such as the eigen-vector corresponding to the largest eigenvalue of the transfer matrix and the ratio of the second to first largest eigenvalue. Challenges steaming from the non-unitarity of the transfer matrix are discussed.

DOI
10.48550/arxiv.2111.00510

Related papers

On the simulation of quantum circuits

Richard Jozsa

We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the number of 2-qubit gates that touch or cross the line j i.e. the number of 2-qubit gates that are applied to qubits i,k with i \leq j \leq k. Let D=max_j D_j. Then the quantum process can be classically simulated in time n poly(2^D). Thus if D=O(log n) then C may be efficiently classically simulated.

arXiv:quant-ph/0603163•Mar 19, 2006•100 citations

Open-boundary integrable quantum circuits with different geometries

Miguel García Fernández, Chiara Paletta, Ana L. Retore

We present a complete classification of integrable Yang-Baxter quantum circuits with open boundary conditions and arbitrary circuit geometries. Starting from the standard transfer-matrix construction with two types of staggered inhomogeneities, we derive a general mapping that determines the arrangement of circuit gates in terms of the inhomogeneities and the system size. We conjecture that time-periodic quantum circuits are integrable whenever the local bulk and boundary gates satisfy the Yang-Baxter equation and the same bulk gate is applied exactly once per period to every nearest-neighbor pair of spins. Our construction also provides an algorithm to detect Yang-Baxter integrability for circuits with arbitrary geometries. Furthermore, we introduce a third type of inhomogeneity, denoted by $ρ$, and demonstrate that the minimum possible circuit depth is four. We show that when these $ρ$-inhomogeneities are placed at the endpoints and in their immediate neighborhood, the resulting boundary gates can be interpreted as single gates acting on multiple sites. Our construction is fully general and applies to regular $R$-matrices, both of difference and non-difference type, together with their associated boundary matrices. As an application, we consider two-qubit gates corresponding to 6- and 8-vertex $R$-matrices of non-difference form satisfying the Yang-Baxter equation, and we construct the associated reflection matrices that generate integrable quantum circuits.

math-phCross-listedarXiv:2607.02093•Jul 3, 2026•1 citation

Quantum Circuit Implementation of Multi-Dimensional Non-Linear Lattice Models

R. Steijl

The application of Quantum Computing (QC) to fluid dynamics simulation has developed into a dynamic research topic in recent years. With many flow problems of scientific and engineering interest requiring large computational resources, the potential of QC to speed-up simulations and facilitate more detailed modeling forms the main motivation for this growing research interest. Despite notable progress, many important challenges to creating quantum algorithms for fluid modeling remain. The key challenge of non-linearity of the governing equations in fluid modeling is investigated here in the context of lattice-based modeling of fluids. Quantum circuits for the D1Q3 (one-dimensional, three discrete velocities) Lattice Boltzmann model are detailed along with design trade-offs involving circuit width and depth. Then, the design is extended to a one-dimensional lattice model for the non-linear Burgers equation. To facilitate the evaluation of non-linear terms, the presented quantum circuits employ quantum computational basis encoding. The second part of this work introduces a novel, modular quantum-circuit implementation for non-linear terms in multi-dimensional lattice models. In particular, the evaluation of kinetic energy in two-dimensional models is detailed as the first step toward quantum circuits for the collision term of two- and three-dimensional Lattice Boltzmann methods. The quantum circuit analysis shows that with O(100) fault-tolerant qubits, meaningful proof-of-concept experiments could be performed in the near future.

Applied Sciences•Dec 30, 2022•18 citations

Quantum algorithms for spin models and simulable gate sets for quantum computation

M. Van den Nest, Wolfgang Dür, Robert Raussendorf +1 more

We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant's match gates can be recovered by using the solvability of the free-fermion eight-vertex model.

arXiv:0805.1214•Physical Review A•Nov 30, 2009•41 citations

On the transfer matrix of the supersymmetric eight-vertex model. II. Open boundary conditions

Christian Hagendorf, Jean Liénardy

Abstract The transfer matrix of the square-lattice eight-vertex model on a strip with vertical lines and open boundary conditions is investigated. It is shown that for vertex weights that obey the relation and appropriately chosen K -matrices this transfer matrix possesses the remarkably simple, non-degenerate eigenvalue . For positive vertex weights, is shown to be the largest transfer-matrix eigenvalue. The corresponding eigenspace is equal to the space of the ground states of the Hamiltonian of a related XYZ spin chain. An essential ingredient in the proofs is the supersymmetry of this Hamiltonian.

arXiv:1911.03348•Journal of Statistical Mechanics Theory and Experiment•Mar 1, 2020•6 citations

Equivalence of transfer matrices

M. A. Novotny

Three theorems dealing with transfer matrices in statistical mechanical systems are proved. The theorems state that the nonzero eigenvalues of transfer matrices formed through various prescriptions are identical. Hence it is possible to ascribe a physical meaning to all the eigenvalues of a transfer matrix, not just to the few largest eigenvalues. The first theorem states that the transfer matrix formed by building a system M layers at a time has as its only nonzero eigenvalues the eigenvalues of the transfer matrix formed by building the M layers of the system one at a time. This theorem relates the product of two nM×nM M-layer transfer matrices to the product of M one-layer M×M transfer matrices. The second theorem states that one of the nM×nM M-layer transfer matrices (for M>1) has only one nonzero eigenvalue. A procedure for finding this eigenvalue and all eigenvectors is given. The third theorem generalizes the first to the case where the chosen layering is not an integer multiple of the interaction length.

Journal of Mathematical Physics•Oct 1, 1988•12 citations
Classical planar vertex models afford transfer matrices with real and positive entries, which makes this class of models suitable for quantum simulations. In this work, we support this statement by building explicit quantum circuits that implement the actions of the transfer matrices on arbitrary many-qubit states. The number of qubits and the depth of the circuits grow linearly with the size of the system. Furthermore, we present tests using quantum simulators and demonstrate that important physical quantities can be extracted, such as the eigen-vector corresponding to the largest eigenvalue of the transfer matrix and the ratio of the second to first largest eigenvalue. Challenges steaming from the non-unitarity of the transfer matrix are discussed.
We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the number of 2-qubit gates that touch or cross the line j i.e. the number of 2-qubit gates that are applied to qubits i,k with i \leq j \leq k. Let D=max_j D_j. Then the quantum process can be classically simulated in time n poly(2^D). Thus if D=O(log n) then C may be efficiently classically simulated.
We present a complete classification of integrable Yang-Baxter quantum circuits with open boundary conditions and arbitrary circuit geometries. Starting from the standard transfer-matrix construction with two types of staggered inhomogeneities, we derive a general mapping that determines the arrangement of circuit gates in terms of the inhomogeneities and the system size. We conjecture that time-periodic quantum circuits are integrable whenever the local bulk and boundary gates satisfy the Yang-Baxter equation and the same bulk gate is applied exactly once per period to every nearest-neighbor pair of spins. Our construction also provides an algorithm to detect Yang-Baxter integrability for circuits with arbitrary geometries. Furthermore, we introduce a third type of inhomogeneity, denoted by ρρρ, and demonstrate that the minimum possible circuit depth is four. We show that when these ρρρ-inhomogeneities are placed at the endpoints and in their immediate neighborhood, the resulting boundary gates can be interpreted as single gates acting on multiple sites. Our construction is fully general and applies to regular RRR-matrices, both of difference and non-difference type, together with their associated boundary matrices. As an application, we consider two-qubit gates corresponding to 6- and 8-vertex RRR-matrices of non-difference form satisfying the Yang-Baxter equation, and we construct the associated reflection matrices that generate integrable quantum circuits.
The application of Quantum Computing (QC) to fluid dynamics simulation has developed into a dynamic research topic in recent years. With many flow problems of scientific and engineering interest requiring large computational resources, the potential of QC to speed-up simulations and facilitate more detailed modeling forms the main motivation for this growing research interest. Despite notable progress, many important challenges to creating quantum algorithms for fluid modeling remain. The key challenge of non-linearity of the governing equations in fluid modeling is investigated here in the context of lattice-based modeling of fluids. Quantum circuits for the D1Q3 (one-dimensional, three discrete velocities) Lattice Boltzmann model are detailed along with design trade-offs involving circuit width and depth. Then, the design is extended to a one-dimensional lattice model for the non-linear Burgers equation. To facilitate the evaluation of non-linear terms, the presented quantum circuits employ quantum computational basis encoding. The second part of this work introduces a novel, modular quantum-circuit implementation for non-linear terms in multi-dimensional lattice models. In particular, the evaluation of kinetic energy in two-dimensional models is detailed as the first step toward quantum circuits for the collision term of two- and three-dimensional Lattice Boltzmann methods. The quantum circuit analysis shows that with O(100) fault-tolerant qubits, meaningful proof-of-concept experiments could be performed in the near future.
We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vertex model as well as a two-dimensional Ising-type model. We show that classically simulating these (complex-parameter) spin models is as hard as simulating universal quantum computation, i.e., BQP complete (BQP denotes bounded-error quantum polynomial time). Furthermore, our mappings provide a framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. We, e.g., show that the simulability of Valiant's match gates can be recovered by using the solvability of the free-fermion eight-vertex model.
Abstract The transfer matrix of the square-lattice eight-vertex model on a strip with vertical lines and open boundary conditions is investigated. It is shown that for vertex weights that obey the relation and appropriately chosen K -matrices this transfer matrix possesses the remarkably simple, non-degenerate eigenvalue . For positive vertex weights, is shown to be the largest transfer-matrix eigenvalue. The corresponding eigenspace is equal to the space of the ground states of the Hamiltonian of a related XYZ spin chain. An essential ingredient in the proofs is the supersymmetry of this Hamiltonian.
Three theorems dealing with transfer matrices in statistical mechanical systems are proved. The theorems state that the nonzero eigenvalues of transfer matrices formed through various prescriptions are identical. Hence it is possible to ascribe a physical meaning to all the eigenvalues of a transfer matrix, not just to the few largest eigenvalues. The first theorem states that the transfer matrix formed by building a system M layers at a time has as its only nonzero eigenvalues the eigenvalues of the transfer matrix formed by building the M layers of the system one at a time. This theorem relates the product of two nM×nM M-layer transfer matrices to the product of M one-layer M×M transfer matrices. The second theorem states that one of the nM×nM M-layer transfer matrices (for M>1) has only one nonzero eigenvalue. A procedure for finding this eigenvalue and all eigenvectors is given. The third theorem generalizes the first to the case where the chosen layering is not an integer multiple of the interaction length.