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:quant-ph/0202042 · Quantum Information and Computation

Time--optimal Hamiltonian simulation and gate synthesis using homogeneous local unitaries

Lluís Masanes, Guifré Vidal, José Ignacio Latorre

Published Jun 1, 2002• 24 citations
arXivHTMLPDF

Abstract

Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non--local Hamiltonian simulation and non--local gate synthesis when only {\em homogeneous} local unitaries are performed in order to tailor the available interaction. Homogeneous (i.e. identical for all subsystems) local manipulation implies a more refined classification of interaction Hamiltonians than the inhomogeneous case, as well as the loss of universality in Hamiltonian simulation. For the case of symmetric two--qubit interactions, we provide time--optimal protocols for both Hamiltonian simulation and gate synthesis.

DOI
10.26421/qic2.4-2

Related papers

Nonlocal Hamiltonian simulation assisted by local operations and classical communication

Guifré Vidal, J. I. Cirac

Consider a set of N systems and an arbitrary interaction Hamiltonian H that couples them. We investigate the use of local operations and classical communication (LOCC), together with the Hamiltonian H, to simulate a unitary evolution of the N systems according to some other Hamiltonian ${H}^{\ensuremath{'}}.$ First, we show that the most general simulation using H and LOCC can also be achieved, with the same time efficiency, by just interspersing the evolution of H with local unitary manipulations (LU) of each system and a corresponding local ancilla (in a so-called LU+anc. protocol). Thus, the ability to make local measurements and to communicate classical information does not help in nonlocal Hamiltonian simulation. Second, we show that both for the case of two d-level systems $(d>2),$ or for that of a setting with more than two systems $(N>2),$ LU+anc. protocols are more powerful than LU protocols. Therefore local ancillas are a useful resource for nonlocal Hamiltonian simulation. Third, we use results of majorization theory to explicitly solve the problem of optimal simulation of two-qubit Hamiltonians using LU (equivalently, LU+anc., LO, or LOCC).

arXiv:quant-ph/0108076•Physical Review A•Aug 27, 2002•33 citations

Time-optimal unitary operations

A. Carlini, Akio Hosoya, Tatsuhiko Koike +1 more

Extending our previous work on time-optimal quantum state evolution [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006)], we formulate a variational principle for finding the time-optimal realization of a target unitary operation, when the available Hamiltonians are subject to certain constraints dictated either by experimental or by theoretical conditions. Since the time-optimal unitary evolutions do not depend on the input quantum state this is of more direct relevance to quantum computation. We explicitly illustrate our method by considering the case of a two-qubit system self-interacting via an anisotropic Heisenberg Hamiltonian and by deriving the time-optimal unitary evolution for three examples of target quantum gates, namely, the swap of qubits, the quantum Fourier transform, and the entangler gate. We also briefly discuss the case in which certain unitary operations take negligible time.

arXiv:quant-ph/0608039•Physical Review A•Apr 10, 2007•126 citations

Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians

Jeongwan Haah, Matthew B. Hastings, Robin Kothari +1 more

We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and is believed to capture fundamental interactions of physics. Our algorithm simulates the time evolution of such a Hamiltonian on $n$ qubits for time $T$ up to error $\epsilon$ using ${\mathcal O}( nT {polylog} (nT/\epsilon))$ gates with depth ${\mathcal O}(T { polylog} (nT/\epsilon))$. Our algorithm is the first simulation algorithm that achieves gate cost quasilinear in $nT$ and polylogarithmic in $1/\epsilon$. Our algorithm also readily generalizes to time-dependent Hamiltonians and yields an algorithm with similar gate count for any piecewise slowly varying time-dependent bounded local Hamiltonian. We also prove a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires ${\widetilde{\Omega}}(nT)$ gates in the worst case. The lower bound holds even if we only require the output state to be correct on local measurements. To the best of our knowledge, this is the first nontrivial lower bound on the gate complexity of the simulation problem. Our algorithm is based on a decomposition of the time-evolution unitary into a product of small unitaries using Lieb--Robinson bounds. In the appendix, we prove a Lieb--Robinson bound tailored to Hamiltonians with small commutators between local terms, giving zero Lieb--Robinson velocity in the limit of commuting Hamiltonians. This improves the performance of our algorithm when the Hamiltonian is close to commuting.

arXiv:1801.03922•SIAM Journal on Computing•Jan 12, 2021•226 citations

Gate simulation and lower bounds on the simulation time

Robert Zeier, Markus Grassl, Thomas Beth

Unitary operations are the building blocks of quantum programs. Our task is to design efficient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given $n$-qubit system. The most common versions of this task are known as Hamiltonian simulation and gate simulation, where Hamiltonian simulation can be seen as an infinitesimal version of the general task of gate simulation. We present a Lie-theoretic approach to Hamiltonian simulation and gate simulation. From this, we derive lower bounds on the time complexity in the $n$-qubit case, generalizing known results to both even and odd $n$. To achieve this we develop a generalization of the so-called magic basis for two-qubits. As a corollary, we note a connection to entanglement measures of concurrence-type.

arXiv:quant-ph/0403082•Physical Review A•Sep 22, 2004•26 citations

Hamiltonian simulation with explicit formulas for Digital-Analog Quantum Computing

Mikel Garcia-de-Andoin, Thorge Müller, Gonzalo Camacho

Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computational time. In this work we find a suboptimal solution to this exponentially large problem, showing that it can be solved within polynomial computational time. In particular, we provide an exact solution for the problem of expressing arbitrary two-body Hamiltonians as the sum of local unitary transformations of an arbitrary Ising Hamiltonian, with the total number of required terms being at most quadratic in system size. This allows us to design a digital-analog simulation protocol that avoids employing numerical optimization over a large parameter space at the preprocessing stage, minimizing computational resources and allowing for further scaling.

quant-pharXiv:2511.11404•Physical Review A•Nov 17, 2025•2 citations

Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians

Jeongwan Haah, Matthew B. Hastings, Robin Kothari +1 more

We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and encompasses all physically reasonable Hamiltonians. Our algorithm simulates the time evolution of such a Hamiltonian on n qubits for time T up to error ε using O(T polylog(nT/ε)) gates with depth O(T polylog(nT/ε)). Our algorithm is the first simulation algorithm that achieves gate cost quasilinear in nT and polylogarithmic in 1/ε. Our algorithm also readily generalizes to time-dependent Hamiltonians and yields an algorithm with similar gate count for any piecewise slowly varying time-dependent bounded local Hamiltonian. We also prove a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires (nT) gates in the worst case. The lower bound holds even if we only require the output state to be correct on local measurements. To our best knowledge, this is the first nontrivial lower bound on the gate complexity of the simulation problem. Our algorithm is based on a decomposition of the time-evolution unitary into a product of small unitaries using Lieb-Robinson bounds. In the appendix, we prove a Lieb-Robinson bound tailored to Hamiltonians with small commutators between local terms, giving zero Lieb-Robinson velocity in the limit of commuting Hamiltonians. This improves the performance of our algorithm when the Hamiltonian is close to commuting.

Annual Symposium on Foundations of Computer Science•Oct 1, 2018•76 citations
Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non--local Hamiltonian simulation and non--local gate synthesis when only {\em homogeneous} local unitaries are performed in order to tailor the available interaction. Homogeneous (i.e. identical for all subsystems) local manipulation implies a more refined classification of interaction Hamiltonians than the inhomogeneous case, as well as the loss of universality in Hamiltonian simulation. For the case of symmetric two--qubit interactions, we provide time--optimal protocols for both Hamiltonian simulation and gate synthesis.
Consider a set of N systems and an arbitrary interaction Hamiltonian H that couples them. We investigate the use of local operations and classical communication (LOCC), together with the Hamiltonian H, to simulate a unitary evolution of the N systems according to some other Hamiltonian ${H}^{\ensuremath{'}}.$ First, we show that the most general simulation using H and LOCC can also be achieved, with the same time efficiency, by just interspersing the evolution of H with local unitary manipulations (LU) of each system and a corresponding local ancilla (in a so-called LU+anc. protocol). Thus, the ability to make local measurements and to communicate classical information does not help in nonlocal Hamiltonian simulation. Second, we show that both for the case of two d-level systems (d>2),(d>2),(d>2), or for that of a setting with more than two systems (N>2),(N>2),(N>2), LU+anc. protocols are more powerful than LU protocols. Therefore local ancillas are a useful resource for nonlocal Hamiltonian simulation. Third, we use results of majorization theory to explicitly solve the problem of optimal simulation of two-qubit Hamiltonians using LU (equivalently, LU+anc., LO, or LOCC).
Extending our previous work on time-optimal quantum state evolution [Carlini et al., Phys. Rev. Lett. 96, 060503 (2006)], we formulate a variational principle for finding the time-optimal realization of a target unitary operation, when the available Hamiltonians are subject to certain constraints dictated either by experimental or by theoretical conditions. Since the time-optimal unitary evolutions do not depend on the input quantum state this is of more direct relevance to quantum computation. We explicitly illustrate our method by considering the case of a two-qubit system self-interacting via an anisotropic Heisenberg Hamiltonian and by deriving the time-optimal unitary evolution for three examples of target quantum gates, namely, the swap of qubits, the quantum Fourier transform, and the entangler gate. We also briefly discuss the case in which certain unitary operations take negligible time.
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and is believed to capture fundamental interactions of physics. Our algorithm simulates the time evolution of such a Hamiltonian on nnn qubits for time TTT up to error ϵ\epsilonϵ using O(nTpolylog(nT/ϵ)){\mathcal O}( nT {polylog} (nT/\epsilon))O(nTpolylog(nT/ϵ)) gates with depth O(Tpolylog(nT/ϵ)){\mathcal O}(T { polylog} (nT/\epsilon))O(Tpolylog(nT/ϵ)). Our algorithm is the first simulation algorithm that achieves gate cost quasilinear in nTnTnT and polylogarithmic in 1/ϵ1/\epsilon1/ϵ. Our algorithm also readily generalizes to time-dependent Hamiltonians and yields an algorithm with similar gate count for any piecewise slowly varying time-dependent bounded local Hamiltonian. We also prove a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires Ω~(nT){\widetilde{\Omega}}(nT)Ω(nT) gates in the worst case. The lower bound holds even if we only require the output state to be correct on local measurements. To the best of our knowledge, this is the first nontrivial lower bound on the gate complexity of the simulation problem. Our algorithm is based on a decomposition of the time-evolution unitary into a product of small unitaries using Lieb--Robinson bounds. In the appendix, we prove a Lieb--Robinson bound tailored to Hamiltonians with small commutators between local terms, giving zero Lieb--Robinson velocity in the limit of commuting Hamiltonians. This improves the performance of our algorithm when the Hamiltonian is close to commuting.
Unitary operations are the building blocks of quantum programs. Our task is to design efficient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given nnn-qubit system. The most common versions of this task are known as Hamiltonian simulation and gate simulation, where Hamiltonian simulation can be seen as an infinitesimal version of the general task of gate simulation. We present a Lie-theoretic approach to Hamiltonian simulation and gate simulation. From this, we derive lower bounds on the time complexity in the nnn-qubit case, generalizing known results to both even and odd nnn. To achieve this we develop a generalization of the so-called magic basis for two-qubits. As a corollary, we note a connection to entanglement measures of concurrence-type.
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its digital gate-based counterpart, designing digital-analog circuits that employ optimal quantum resources often requires an exceedingly large classical computational time. In this work we find a suboptimal solution to this exponentially large problem, showing that it can be solved within polynomial computational time. In particular, we provide an exact solution for the problem of expressing arbitrary two-body Hamiltonians as the sum of local unitary transformations of an arbitrary Ising Hamiltonian, with the total number of required terms being at most quadratic in system size. This allows us to design a digital-analog simulation protocol that avoids employing numerical optimization over a large parameter space at the preprocessing stage, minimizing computational resources and allowing for further scaling.
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and encompasses all physically reasonable Hamiltonians. Our algorithm simulates the time evolution of such a Hamiltonian on n qubits for time T up to error ε using O(T polylog(nT/ε)) gates with depth O(T polylog(nT/ε)). Our algorithm is the first simulation algorithm that achieves gate cost quasilinear in nT and polylogarithmic in 1/ε. Our algorithm also readily generalizes to time-dependent Hamiltonians and yields an algorithm with similar gate count for any piecewise slowly varying time-dependent bounded local Hamiltonian. We also prove a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires (nT) gates in the worst case. The lower bound holds even if we only require the output state to be correct on local measurements. To our best knowledge, this is the first nontrivial lower bound on the gate complexity of the simulation problem. Our algorithm is based on a decomposition of the time-evolution unitary into a product of small unitaries using Lieb-Robinson bounds. In the appendix, we prove a Lieb-Robinson bound tailored to Hamiltonians with small commutators between local terms, giving zero Lieb-Robinson velocity in the limit of commuting Hamiltonians. This improves the performance of our algorithm when the Hamiltonian is close to commuting.