Nearly optimal quasienergy estimation and eigenstate preparation of time-periodic Hamiltonians by Sambe space formalism

• URL: http://arxiv.org/abs/2401.02700v1
• Date: Fri, 5 Jan 2024 08:08:11 GMT
• Title: Nearly optimal quasienergy estimation and eigenstate preparation of time-periodic Hamiltonians by Sambe space formalism
• Authors: Kaoru Mizuta
• Abstract summary: Time-periodic (Floquet) systems are one of the most interesting nonequilibrium systems. We show that quasienergy and Floquet eigenstates can be computed almost as efficiently as time-independent cases.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Time-periodic (Floquet) systems are one of the most interesting nonequilibrium systems. As the computation of energy eigenvalues and eigenstates of time-independent Hamiltonians is a central problem in both classical and quantum computation, quasienergy and Floquet eigenstates are the important targets. However, their computation has difficulty of time dependence; the problem can be mapped to a time-independent eigenvalue problem by the Sambe space formalism, but it instead requires additional infinite dimensional space and seems to yield higher computational cost than the time-independent cases. It is still unclear whether they can be computed with guaranteed accuracy as efficiently as the time-independent cases. We address this issue by rigorously deriving the cutoff of the Sambe space to achieve the desired accuracy and organizing quantum algorithms for computing quasienergy and Floquet eigenstates based on the cutoff. The quantum algorithms return quasienergy and Floquet eigenstates with guaranteed accuracy like Quantum Phase Estimation (QPE), which is the optimal algorithm for outputting energy eigenvalues and eigenstates of time-independent Hamiltonians. While the time periodicity provides the additional dimension for the Sambe space and ramifies the eigenstates, the query complexity of the algorithms achieves the near-optimal scaling in allwable errors. In addition, as a by-product of these algorithms, we also organize a quantum algorithm for Floquet eigenstate preparation, in which a preferred gapped Floquet eigenstate can be deterministically implemented with nearly optimal query complexity in the gap. These results show that, despite the difficulty of time-dependence, quasienergy and Floquet eigenstates can be computed almost as efficiently as time-independent cases, shedding light on the accurate and fast simulation of nonequilibrium systems on quantum computers.

Related papers

• Taming Quantum Time Complexity [50.10645865330582]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer [0.6615826432503729]
  probabilistic imaginary-time evolution (PITE) is a promising candidate for preparing the ground state of the Hamiltonian. We analyze the computational costs of the PITE method for both linear and exponential scheduling of the imaginary-time step size. The findings of this study can make a significant contribute to the field of ground-state preparation of many-body Hamiltonians on quantum computers.
  arXiv  Detail & Related papers  (2023-05-08T10:20:57Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Optimal/Nearly-optimal simulation of multi-periodic time-dependent Hamiltonians [0.0]
  We establish a QET-based approach for simulating time-dependent Hamiltonians with multiple time-periodicity. Overcoming the difficulty of time-dependency, our protocol can simulate the dynamics under multi-periodic time-dependent Hamiltonians.
  arXiv  Detail & Related papers  (2023-01-16T01:53:09Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond [0.0]
  Simulation of continuous time evolution requires time discretization on both classical and quantum computers. We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
  arXiv  Detail & Related papers  (2022-09-26T12:54:32Z)
• Optimal Hamiltonian simulation for time-periodic systems [0.8206877486958002]
  We establish optimal/nearly-optimal Hamiltonian simulation for generic time-dependent systems with time-periodicity, known as Floquet systems. Our results will shed light on nonequilibrium phenomena in condensed matter physics and quantum chemistry, and quantum tasks yielding time-dependency in quantum computation.
  arXiv  Detail & Related papers  (2022-09-12T07:06:04Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• A quantum algorithm for the direct estimation of the steady state of open quantum systems [0.0]
  We develop an efficient quantum algorithm for the direct estimation of averaged expectation values of observables on the non-equilibrium steady state. The algorithm encodes the vectorized representation of the density matrix on a quantum register. We show that the output state of the algorithm allows to estimate expectation values of observables on the steady state.
  arXiv  Detail & Related papers  (2020-08-17T07:45:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.