Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2407.06290

Help | Advanced Search

Quantum Physics

arXiv:2407.06290 (quant-ph)
[Submitted on 8 Jul 2024 ]

Title: Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes

Title: 基于门的量子模拟在指数级多模式上的高斯玻色电路

Authors:Alice Barthe, M. Cerezo, Andrew T. Sornborger, Martin Larocca, Diego García-Martín
Abstract: We introduce a framework for simulating, on an $(n+1)$-qubit quantum computer, the action of a Gaussian Bosonic (GB) circuit on a state over $2^n$ modes. Specifically, we encode the initial bosonic state's expectation values over quadrature operators (and their covariance matrix) as an input qubit-state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real (imaginary) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a BQP-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on $\sim8$ billion modes, illustrating the power of our framework.
Abstract: 我们引入了一个框架,用于在 $(n+1)$-量子比特量子计算机上模拟高斯玻色子(GB)电路对 $2^n$模式上的状态的作用。 具体来说,我们将初始玻色子状态在正交算符上的期望值(以及其协方差矩阵)作为输入量子态进行编码。 然后通过一个有效实现由GB门引起的辛传播子的量子电路对其进行演化。 我们发现了一些GB电路和初始状态,使得量子模拟变得高效。 为此,我们引入了一个字典,将GB门和量子比特门进行映射,使得粒子保持(非粒子保持)的GB门在量子比特层面上导致实(虚)时间演化。 对于粒子保持电路的特殊情况,我们提出一个BQP完全的GB决策问题,表明在指数级多模式上的高斯状态的GB演化与通用量子计算机一样强大。 我们还对包含 $\sim8$十亿个模式的干涉仪进行了数值模拟,展示了我们框架的强大功能。
Comments: 5+14 pages, 3 figures, 1 table
Subjects: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC)
Cite as: arXiv:2407.06290 [quant-ph]
  (or arXiv:2407.06290v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2407.06290
arXiv-issued DOI via DataCite
Journal reference: LA-UR-24-26564
Related DOI: https://doi.org/10.1103/PhysRevLett.134.070604
DOI(s) linking to related resources

Submission history

From: Alice Barthe [view email]
[v1] Mon, 8 Jul 2024 18:04:16 UTC (1,299 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.CC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号