A quantum algorithm for modular flow

• URL: http://arxiv.org/abs/2508.16826v1
• Date: Fri, 22 Aug 2025 22:45:31 GMT
• Title: A quantum algorithm for modular flow
• Authors: Ian T. Lim, Isaac H. Kim,
• Abstract summary: Entanglement is a defining property of quantum systems.<n>For a subsystem, one can formally define an operator known as the modular Hamiltonian, which is closely linked to the entanglement properties of that subsystem, and a corresponding operator flow called the modular flow.<n>In this work, we briefly review the quantum singular value transform (QSVT) framework for developing quantum algorithms, and then discuss the implementation of modular flow within this framework.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement is a defining property of quantum systems. For a subsystem of a larger quantum system, one can formally define an operator known as the modular Hamiltonian, which is closely linked to the entanglement properties of that subsystem, and a corresponding operator flow called the modular flow. Algorithms for estimating the von Neumann entropy, the best-known entanglement measure, are well-established, but no equivalent procedures have been previously described for the modular flow. In this work, we briefly review the quantum singular value transform (QSVT) framework for developing quantum algorithms, and then discuss the implementation of modular flow within this framework. We conclude by describing select applications of our modular flow algorithm, such as extracting the chiral central charge of a topologically ordered system and simulating the experience of the bulk observer in holography. We also prove a query complexity lower bound for modular flow, which shows that our method cannot be improved further substantially.

Related papers

• Qumode-Based Variational Quantum Eigensolver for Molecular Excited States [43.148034499498586]
  We introduce the Qumode Subspace Variational Quantum Eigensolver (QSS-VQE), a hybrid quantum-classical algorithm for computing molecular excited states.<n>We demonstrate the performance of QSS-VQE through simulations of molecular excited states, including dihydrogen and a conical intersection in cytosine.
  arXiv  Detail & Related papers  (2025-09-05T00:53:51Z)
• Entanglement harvesting and curvature of entanglement: A modular operator approach [0.0]
  An operator-algebraic framework based on Tomita-Takesaki modular theory is used to study aspects of quantum entanglement.<n>The entanglement structure of quantum fields is studied through the protocol of entanglement harvesting.
  arXiv  Detail & Related papers  (2025-08-17T20:55:10Z)
• Fast simulations of continuous-variable circuits using the coherent state decomposition [0.0]
  We present ttexttlcg_plus, an open-source Python library for the simulation of continuous-variable quantum circuits.<n>Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states.<n>We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer.
  arXiv  Detail & Related papers  (2025-08-08T09:44:58Z)
• Module-conditioned distribution of quantum circuits [4.513787113118679]
  We derive an exact integer programming approach for the Distributed Quantum Circuit problem, assuming fixed module allocations.<n>We show that the optimal module allocation is the trivial one found by this method.
  arXiv  Detail & Related papers  (2025-01-21T01:48:22Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.