发布求助
文献互助 智能选刊 最新文献

Quantum最新文献

筛选
英文 中文
Modular quantum signal processing in many variables 多变量模块化量子信号处理
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-18 DOI: 10.22331/q-2025-06-18-1776
Zane M. Rossi, Jack L. Ceroni, Isaac L. Chuang
{"title":"Modular quantum signal processing in many variables","authors":"Zane M. Rossi, Jack L. Ceroni, Isaac L. Chuang","doi":"10.22331/q-2025-06-18-1776","DOIUrl":"https://doi.org/10.22331/q-2025-06-18-1776","url":null,"abstract":"Despite significant advances in quantum algorithms, quantum programs in practice are often expressed at the circuit level, forgoing helpful structural abstractions common to their classical counterparts. Consequently, as many quantum algorithms have been unified with the advent of quantum signal processing (QSP) and quantum singular value transformation (QSVT), an opportunity has appeared to cast these algorithms as modules that can be combined to constitute complex programs. Complicating this, however, is that while QSP/QSVT are often described by the polynomial transforms they apply to the singular values of large linear operators, and the algebraic manipulation of polynomials is simple, the QSP/QSVT protocols realizing analogous manipulations of their embedded polynomials are non-obvious. Here we provide a theory of modular multi-input-output QSP-based superoperators, the basic unit of which we call a $gadget$, and show they can be snapped together with LEGO-like ease at the level of the functions they apply. To demonstrate this ease, we also provide a Python package for assembling gadgets and compiling them to circuits. Viewed alternately, gadgets both enable the efficient block encoding of large families of useful multivariable functions, and substantiate a functional-programming approach to quantum algorithm design in recasting QSP and QSVT as monadic types.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"12 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144311798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalizing the matching decoder for the Chamon code 推广了Chamon码的匹配解码器
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-18 DOI: 10.22331/q-2025-06-18-1775
Zohar Schwartzman-Nowik, Benjamin J. Brown
{"title":"Generalizing the matching decoder for the Chamon code","authors":"Zohar Schwartzman-Nowik, Benjamin J. Brown","doi":"10.22331/q-2025-06-18-1775","DOIUrl":"https://doi.org/10.22331/q-2025-06-18-1775","url":null,"abstract":"Different choices of quantum error-correcting codes can reduce the demands on the physical hardware needed to build a quantum computer. To achieve the full potential of a code, we must develop practical decoding algorithms that can correct errors that have occurred with high likelihood. Matching decoders are very good at correcting local errors while also demonstrating fast run times that can keep pace with physical quantum devices. We implement variations of a matching decoder for a three-dimensional, non-CSS, low-density parity check code known as the Chamon code, which has a non-trivial structure that does not lend itself readily to this type of decoding. The non-trivial structure of the syndrome of this code means that we can supplement the decoder with additional steps to improve the threshold error rate, below which the logical failure rate decreases with increasing code distance. We find that a generalized matching decoder that is augmented by a belief-propagation step prior to matching gives a threshold of 10.5% for depolarizing noise.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"7 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144312098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exact, Average, and Broken Symmetries in a Simple Adaptive Monitored Circuit 简单自适应监测电路中的精确对称性、平均对称性和破缺对称性
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-17 DOI: 10.22331/q-2025-06-17-1771
Zhi Li, Zhu-Xi Luo
{"title":"Exact, Average, and Broken Symmetries in a Simple Adaptive Monitored Circuit","authors":"Zhi Li, Zhu-Xi Luo","doi":"10.22331/q-2025-06-17-1771","DOIUrl":"https://doi.org/10.22331/q-2025-06-17-1771","url":null,"abstract":"Symmetry is a powerful tool for understanding phases of matter in equilibrium. Quantum circuits with measurements have recently emerged as a platform for novel states of matter intrinsically out of equilibrium. Can symmetry be used as an organizing principle for these novel states, their phases and phase transitions? In this work, we give an affirmative answer to this question in a simple adaptive monitored circuit, which hosts an ordering transition in addition to a separate entanglement transition, upon tuning a single parameter. Starting from a symmetry-breaking initial state, depending on the tuning parameter, the steady state could (i) remain symmetry-broken, (ii) exhibit the average symmetry in the ensemble of trajectories, or (iii) exhibit the exact symmetry for each trajectory. The ordering transition is mapped to the transition in a classical majority vote model, described by the Ising universality class, while the entanglement transition lies in the percolation class. Numerical simulations are further presented to support the analytical understandings.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"18 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144305463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Accurate neural quantum states for interacting lattice bosons 相互作用晶格玻色子的精确神经量子态
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-17 DOI: 10.22331/q-2025-06-17-1772
Zakari Denis, Giuseppe Carleo
{"title":"Accurate neural quantum states for interacting lattice bosons","authors":"Zakari Denis, Giuseppe Carleo","doi":"10.22331/q-2025-06-17-1772","DOIUrl":"https://doi.org/10.22331/q-2025-06-17-1772","url":null,"abstract":"In recent years, neural quantum states have emerged as a powerful variational approach, achieving state-of-the-art accuracy when representing the ground-state wave function of a great variety of quantum many-body systems, including spin lattices, interacting fermions or continuous-variable systems. However, accurate neural representations of the ground state of interacting bosons on a lattice have remained elusive. We introduce a neural backflow Jastrow Ansatz, in which occupation factors are dressed with translationally equivariant many-body features generated by a deep neural network. We show that this neural quantum state is able to faithfully represent the ground state of the 2D Bose-Hubbard Hamiltonian across all values of the interaction strength. We scale our simulations to lattices of dimension up to $20{times}20$ while achieving the best variational energies reported for this model. This enables us to investigate the scaling of the entanglement entropy across the superfluid-to-Mott quantum phase transition, a quantity hard to extract with non-variational approaches.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"100 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144305464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Simulating Meson Scattering on Spin Quantum Simulators 自旋量子模拟器上介子散射模拟
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-17 DOI: 10.22331/q-2025-06-17-1773
Elizabeth R. Bennewitz, Brayden Ware, Alexander Schuckert, Alessio Lerose, Federica M. Surace, Ron Belyansky, William Morong, De Luo, Arinjoy De, Kate S. Collins, Or Katz, Christopher Monroe, Zohreh Davoudi, Alexey V. Gorshkov
{"title":"Simulating Meson Scattering on Spin Quantum Simulators","authors":"Elizabeth R. Bennewitz, Brayden Ware, Alexander Schuckert, Alessio Lerose, Federica M. Surace, Ron Belyansky, William Morong, De Luo, Arinjoy De, Kate S. Collins, Or Katz, Christopher Monroe, Zohreh Davoudi, Alexey V. Gorshkov","doi":"10.22331/q-2025-06-17-1773","DOIUrl":"https://doi.org/10.22331/q-2025-06-17-1773","url":null,"abstract":"Studying high-energy collisions of composite particles, such as hadrons and nuclei, is an outstanding goal for quantum simulators. However, preparation of hadronic wave packets has posed a significant challenge, due to the complexity of hadrons and the precise structure of wave packets. This has limited demonstrations of hadron scattering on quantum simulators to date. Observations of confinement and composite excitations in quantum spin systems have opened up the possibility to explore scattering dynamics in spin models. In this article, we develop two methods to create entangled spin states corresponding to wave packets of composite particles in analog quantum simulators of Ising spin Hamiltonians. One wave-packet preparation method uses the blockade effect enabled by beyond-nearest-neighbor Ising spin interactions. The other method utilizes a quantum-bus-mediated exchange, such as the native spin-phonon coupling in trapped-ion arrays. With a focus on trapped-ion simulators, we numerically benchmark both methods and show that high-fidelity wave packets can be achieved in near-term experiments. We numerically study scattering of wave packets for experimentally realizable parameters in the Ising model and find inelastic-scattering regimes, corresponding to particle production in the scattering event, with prominent and distinct experimental signals. Our proposal, therefore, demonstrates the potential of observing inelastic scattering in near-term quantum simulators.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"29 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144305486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A quantum algorithm for linear autonomous differential equations via Padé approximation 线性自治微分方程的pad<s:1>近似量子算法
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-17 DOI: 10.22331/q-2025-06-17-1770
Dekuan Dong, Yingzhou Li, Jungong Xue
{"title":"A quantum algorithm for linear autonomous differential equations via Padé approximation","authors":"Dekuan Dong, Yingzhou Li, Jungong Xue","doi":"10.22331/q-2025-06-17-1770","DOIUrl":"https://doi.org/10.22331/q-2025-06-17-1770","url":null,"abstract":"We propose a novel quantum algorithm for solving linear autonomous ordinary differential equations (ODEs) using the Padé approximation. For linear autonomous ODEs, the discretized solution can be represented by a product of matrix exponentials. The proposed algorithm approximates the matrix exponential by the diagonal Padé approximation, which is then encoded into a large, block-sparse linear system and solved via quantum linear system algorithms (QLSA). The detailed quantum circuit is given based on quantum oracle access to the matrix, the inhomogeneous term, and the initial state. The complexity of the proposed algorithm is analyzed. Compared to the method based on Taylor approximation, which approximates the matrix exponential using a $k$-th order Taylor series, the proposed algorithm improves the approximation order $k$ from two perspectives: 1) the explicit complexity dependency on $k$ is improved, and 2) a smaller $k$ suffices for the same precision. Numerical experiments demonstrate the advantages of the proposed algorithm comparing to other related algorithms.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"123 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144305461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Family of attainable geometric quantum speed limits 可实现的几何量子速度极限族
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-17 DOI: 10.22331/q-2025-06-17-1774
Zi-yi Mai, Zheng Liu, Chang-shui Yu
{"title":"Family of attainable geometric quantum speed limits","authors":"Zi-yi Mai, Zheng Liu, Chang-shui Yu","doi":"10.22331/q-2025-06-17-1774","DOIUrl":"https://doi.org/10.22331/q-2025-06-17-1774","url":null,"abstract":"We propose a quantum state distance and develop a family of geometrical quantum speed limits (QSLs) for open and closed systems. The QSL time includes an alternative function by which we derive three QSL times with particularly chosen functions. It indicates that two QSL times are exactly the ones presented in Ref. [1] and [2], respectively, and the third one can provide a unified QSL time for both open and closed systems. The three QSL times are attainable for any given initial state in the sense that there exists a dynamics driving the initial state to evolve along the geodesic. We numerically compare the tightness of the three QSL times, which typically promises a tighter QSL time if optimizing the alternative function.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"22 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144305465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal number of stabilizer measurement rounds in an idling surface code patch 空转表面代码补丁中稳定器测量弹数的最优
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-12 DOI: 10.22331/q-2025-06-12-1767
Áron Márton, János K. Asbóth
{"title":"Optimal number of stabilizer measurement rounds in an idling surface code patch","authors":"Áron Márton, János K. Asbóth","doi":"10.22331/q-2025-06-12-1767","DOIUrl":"https://doi.org/10.22331/q-2025-06-12-1767","url":null,"abstract":"Logical qubits can be protected against environmental noise by encoding them into a highly entangled state of many physical qubits and actively intervening in the dynamics with stabilizer measurements. In this work, we numerically optimize the rate of these interventions: the number of stabilizer measurement rounds for a logical qubit encoded in a surface code patch and idling for a given time. We model the environmental noise on the circuit level, including gate errors, readout errors, amplitude and phase damping. We find, qualitatively, that the optimal number of stabilizer measurement rounds is getting smaller for better qubits and getting larger for better gates or larger code sizes. We discuss the implications of our results to some of the leading architectures, superconducting qubits, and neutral atoms.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"22 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144268996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Low Overhead Qutrit Magic State Distillation 低开销Qutrit魔法状态蒸馏
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-12 DOI: 10.22331/q-2025-06-12-1768
Shiroman Prakash, Tanay Saha
{"title":"Low Overhead Qutrit Magic State Distillation","authors":"Shiroman Prakash, Tanay Saha","doi":"10.22331/q-2025-06-12-1768","DOIUrl":"https://doi.org/10.22331/q-2025-06-12-1768","url":null,"abstract":"We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with an approach to fault-tolerant quantum computing known as magic state distillation. We construct a family of $[[9m-k, k, 2]]_3$ triorthogonal qutrit error-correcting codes for any positive integers $m$ and $k$ with $k leq 3m-2$ that are suitable for magic state distillation. In magic state distillation, the number of ancillae required to produce a magic state with target error rate $epsilon$ is $O(log^gamma epsilon^{-1})$, where the yield parameter $gamma$ characterizes the overhead cost. For $k=3m-2$, our codes have $gamma = log_2 (2+frac{6}{3 m-2})$, which tends to $1$ as $m to infty$. Moreover, the $[[20,7,2]]_3$ qutrit code that arises from our construction when $m=3$ already has a yield parameter of $1.51$ which outperforms all known qubit triorthogonal codes of size less than a few hundred qubits.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"14 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144269030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal estimates of trace distance between bosonic Gaussian states and applications to learning 玻色子高斯态间迹距的最优估计及其在学习中的应用
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-12 DOI: 10.22331/q-2025-06-12-1769
Lennart Bittel, Francesco Anna Mele, Antonio Anna Mele, Salvatore Tirone, Ludovico Lami
{"title":"Optimal estimates of trace distance between bosonic Gaussian states and applications to learning","authors":"Lennart Bittel, Francesco Anna Mele, Antonio Anna Mele, Salvatore Tirone, Ludovico Lami","doi":"10.22331/q-2025-06-12-1769","DOIUrl":"https://doi.org/10.22331/q-2025-06-12-1769","url":null,"abstract":"Gaussian states of bosonic quantum systems enjoy numerous technological applications and are ubiquitous in nature. Their significance lies in their simplicity, which in turn rests on the fact that they are uniquely determined by two experimentally accessible quantities, their first and second moments. But what if these moments are only known approximately, as is inevitable in any realistic experiment? What is the resulting error on the Gaussian state itself, as measured by the most operationally meaningful metric for distinguishing quantum states, namely, the trace distance? In this work, we fully resolve this question by demonstrating that if the first and second moments are known up to an error $varepsilon$, the trace distance error on the state also scales as $varepsilon$, and this functional dependence is optimal. To prove this, we establish tight bounds on the trace distance between two Gaussian states in terms of the norm distance of their first and second moments. As an application, we improve existing bounds on the sample complexity of tomography of Gaussian states.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"9 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144268997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信