Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach

DOI10.1007/S00220-025-05240-6MaRDI QIDQ7025811zbMATH OpenFDO

Authors Zhiyan Ding, Marius Junge, Philipp Schleich, Peixue Wu

Publication date 19 February 2025

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00220-025-05240-6

zbMATH Keywords

convexified gate countopen quantum systemsquantum gatesquantum Markov semigroupssimulation cost

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum gates (81P65) Quantum computation (81P68) Open systems, reduced dynamics, master equations, decoherence (81S22) Quantum stochastic calculus (81S25)

Review text

The paper is focused on the problem of finding the simulation cost of the dynamics of open quantum system. Specifically, the authors' question is: Given a set of accessible unitary gates and a quantum Markov semigroup \(T_t\), what is the minimum number of gates (minimal gate count) needed to simulate \(T_t\)?\N\NThe upper bound of the simulation cost of quantum dynamics has been extensively studied through various quantum algorithms, much less work has focused on establishing the lower bound, particularly for the simulation of open quantum system dynamics. In this work, the authors present a general framework to calculate the lower bound for simulating a broad class of quantum Markov semigroups. Given a fixed accessible unitary set, they introduce the concept of convexified gate count to quantify the quantum simulation cost and analyze the necessary gate count to construct a quantum simulation scheme that achieves a specific order. This framework can be applied to both unital and non-unital quantum dynamics, and the tightness of the lower bound technique is illustrated by showing that the upper and lower bounds coincide in several examples. In particular, they derive an explicit tight lower bound for Pauli noise on \(n\)-qubit system.

Cites work

• Complexity of quantum circuits via sensitivity, magic, and coherence
• Efficient Quantum Algorithms for Simulating Lindblad Evolution
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Ergodic and mixing quantum channels in finite dimensions
• Exponential improvement in precision for simulating sparse Hamiltonians
• Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems
• Hamiltonian simulation with nearly optimal dependence on all parameters
• scientific article; zbMATH DE number 3737613 (Why is no real title available?)
• scientific article; zbMATH DE number 2153055 (Why is no real title available?)
• scientific article; zbMATH DE number 2153061 (Why is no real title available?)
• scientific article; zbMATH DE number 6131346 (Why is no real title available?)
• On the generators of quantum dynamical semigroups
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Simulating Markovian open quantum systems using higher-order series expansion
• Structure of uniformly continuous quantum Markov semigroups
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• The Quantum Wasserstein Distance of Order 1

Cited in

(1)

• Wasserstein complexity of quantum circuits

This page was built for publication: Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025811)