Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This research introduces randomized quantum algorithms that simulate open quantum systems with exponential accuracy while drastically reducing the number of ancilla qubits required. By leveraging dissipative processes with minimal resource overhead, the proposed methods offer a practical pathway for observable estimation on early fault-tolerant quantum devices. The work addresses a critical bottleneck in quantum simulation by decoupling circuit depth from parameter complexity, enhancing feasibility for near-term hardware.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla

arXiv3 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2412.19453v5 Announce Type: replace Abstract: Simulating open quantum systems is an essential technique for understanding complex physical phenomena and advancing quantum technologies. Some quantum algorithms simulate Lindblad dynamics exponentially accurately, i.e., they achieve logarithmically short circuit depth in terms of accuracy, but they need to coherently encode all possible jump operators with a large ancilla consumption. Minimizing the gate and ancilla counts while achieving such a logarithmic scaling in accuracy remains an important challenge. In this work, we present two randomized quantum algorithms for simulating general Lindblad dynamics with multiple jump operators aimed at an observable estimation that achieves a circuit depth with not only logarithmic scaling in accuracy but also either partial or complete independence from the parameters specifying the Lindbladian. This is based on a novel random circuit compilation method that leverages dissipative processes with only a single jump operator, leading to the proposed methods using minimal ancilla qubits---$4+\lceil\log_2 M\rceil$ in the first case and $7$ in the other, where each single jump operator has at most $M$ Pauli strings. In addition, we numerically demonstrate the practical advantage over existing approaches by providing a detailed analysis of the required gate and ancilla counts. This work represents a significant step toward making open quantum system simulations more feasible on early fault-tolerant quantum computing devices.

Abstract:Simulating open quantum systems is an essential technique for understanding complex physical phenomena and advancing quantum technologies. Some quantum algorithms simulate Lindblad dynamics exponentially accurately, i.e., they achieve logarithmically short circuit depth in terms of accuracy, but they need to coherently encode all possible jump operators with a large ancilla consumption. Minimizing the gate and ancilla counts while achieving such a logarithmic scaling in accuracy remains an important challenge. In this work, we present two randomized quantum algorithms for simulating general Lindblad dynamics with multiple jump operators aimed at an observable estimation that achieves a circuit depth with not only logarithmic scaling in accuracy but also either partial or complete independence from the parameters specifying the Lindbladian. This is based on a novel random circuit compilation method that leverages dissipative processes with only a single jump operator, leading to the proposed methods using minimal ancilla qubits---$4+\lceil\log_2 M\rceil$ in the first case and $7$ in the other, where each single jump operator has at most $M$ Pauli strings. In addition, we numerically demonstrate the practical advantage over existing approaches by providing a detailed analysis of the required gate and ancilla counts. This work represents a significant step toward making open quantum system simulations more feasible on early fault-tolerant quantum computing devices.

arXiv:2412.19453 [quant-ph]

(or arXiv:2412.19453v5 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2412.19453 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1103/91yq-swlv Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 309 cuvinte

Subiecte conexe