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

Quantum最新文献

筛选
英文 中文
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
Simulation of open quantum systems on universal quantum computers 开放量子系统在通用量子计算机上的模拟
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-05 DOI: 10.22331/q-2025-06-05-1765
Huan-Yu Liu, Xiaoshui Lin, Zhao-Yun Chen, Cheng Xue, Tai-Ping Sun, Qing-Song Li, Xi-Ning Zhuang, Yun-Jie Wang, Yu-Chun Wu, Ming Gong, Guo-Ping Guo
{"title":"Simulation of open quantum systems on universal quantum computers","authors":"Huan-Yu Liu, Xiaoshui Lin, Zhao-Yun Chen, Cheng Xue, Tai-Ping Sun, Qing-Song Li, Xi-Ning Zhuang, Yun-Jie Wang, Yu-Chun Wu, Ming Gong, Guo-Ping Guo","doi":"10.22331/q-2025-06-05-1765","DOIUrl":"https://doi.org/10.22331/q-2025-06-05-1765","url":null,"abstract":"The rapid development of quantum computers has enabled demonstrations of quantum advantages on various tasks. However, real quantum systems are always dissipative due to their inevitable interaction with the environment, and the resulting non-unitary dynamics make quantum simulation challenging with only unitary quantum gates. In this work, we present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel and thus can be effectively sampled using quantum computers. This method has several benefits, including no need for auxiliary qubits and noteworthy scalability. Moreover, some long-time properties like steady states and the thermal equilibrium can also be investigated as the adjoint density matrix and the true dissipated one converge to the same state. Finally, we present deployments of this theory in the dissipative quantum $XY$ model for the evolution of correlation and entropy with short-time dynamics and the disordered Heisenberg model for many-body localization with long-time dynamics. This work promotes the study of real-world many-body dynamics with quantum computers, highlighting the potential to demonstrate practical quantum advantages.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"16 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144218691","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
Stabilizer codes for Heisenberg-limited many-body Hamiltonian estimation 海森堡有限多体哈密顿估计的稳定器代码
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-05 DOI: 10.22331/q-2025-06-05-1766
Santanu Bosu Antu, Sisi Zhou
{"title":"Stabilizer codes for Heisenberg-limited many-body Hamiltonian estimation","authors":"Santanu Bosu Antu, Sisi Zhou","doi":"10.22331/q-2025-06-05-1766","DOIUrl":"https://doi.org/10.22331/q-2025-06-05-1766","url":null,"abstract":"Estimating many-body Hamiltonians has wide applications in quantum technology. By allowing coherent evolution of quantum systems and entanglement across multiple probes, the precision of estimating a fully connected $k$-body interaction can scale up to $(n^kt)^{-1}$, where $n$ is the number of probes and $t$ is the probing time. However, the optimal scaling may no longer be achievable under quantum noise, and it is important to apply quantum error correction in order to recover this limit. In this work, we study the performance of stabilizer quantum error correcting codes in estimating many-body Hamiltonians under noise. When estimating a fully connected $ZZZ$ interaction under single-qubit noise, we showcase three families of stabilizer codes – thin surface codes, quantum Reed–Muller codes and Shor codes – that achieve the scalings of $(nt)^{-1}$, $(n^2t)^{-1}$ and $(n^3t)^{-1}$, respectively, all of which are optimal with $t$. We further discuss the relation between stabilizer structure and the scaling with $n$, and identify several no-go theorems. For instance, we find codes with constant-weight stabilizer generators can at most achieve the $n^{-1}$ scaling, while the optimal $n^{-3}$ scaling is achievable if and only if the code bears a repetition code substructure, like in Shor code.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"17 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144218747","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
Explicit block encodings of boundary value problems for many-body elliptic operators 多体椭圆算子边值问题的显式分组编码
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-04 DOI: 10.22331/q-2025-06-04-1764
Tyler Kharazi, Ahmad M. Alkadri, Jin-Peng Liu, Kranthi K. Mandadapu, K. Birgitta Whaley
{"title":"Explicit block encodings of boundary value problems for many-body elliptic operators","authors":"Tyler Kharazi, Ahmad M. Alkadri, Jin-Peng Liu, Kranthi K. Mandadapu, K. Birgitta Whaley","doi":"10.22331/q-2025-06-04-1764","DOIUrl":"https://doi.org/10.22331/q-2025-06-04-1764","url":null,"abstract":"Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"43 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144218689","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
Pseudorandom unitaries are neither real nor sparse nor noise-robust 伪随机酉点既不真实，也不稀疏，也不具有噪声鲁棒性
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-04 DOI: 10.22331/q-2025-06-04-1759
Tobias Haug, Kishor Bharti, Dax Enshan Koh
{"title":"Pseudorandom unitaries are neither real nor sparse nor noise-robust","authors":"Tobias Haug, Kishor Bharti, Dax Enshan Koh","doi":"10.22331/q-2025-06-04-1759","DOIUrl":"https://doi.org/10.22331/q-2025-06-04-1759","url":null,"abstract":"Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) possess the dual nature of being efficiently constructible while appearing completely random to any efficient quantum algorithm. In this study, we establish fundamental bounds on pseudorandomness. We show that PRSs and PRUs exist only when the probability that an error occurs is negligible, ruling out their generation on noisy intermediate-scale and early fault-tolerant quantum computers. Further, we show that PRUs need imaginarity while PRS do not have this restriction. This implies that quantum randomness requires in general a complex-valued formalism of quantum mechanics, while for random quantum states real numbers suffice. Additionally, we derive lower bounds on the coherence of PRSs and PRUs, ruling out the existence of sparse PRUs and PRSs. We also show that the notions of PRS, PRUs and pseudorandom scramblers (PRSSs) are distinct in terms of resource requirements. We introduce the concept of pseudoresources, where states which contain a low amount of a given resource masquerade as high-resource states. We define pseudocoherence, pseudopurity and pseudoimaginarity, and identify three distinct types of pseudoresources in terms of their masquerading capabilities. Our work also establishes rigorous bounds on the efficiency of property testing, demonstrating the exponential complexity in distinguishing real quantum states from imaginary ones, in contrast to the efficient measurability of unitary imaginarity. Further, we show an exponential advantage in imaginarity testing when having access to the complex conjugate of the state. Lastly, we show that the transformation from a complex to a real model of quantum computation is inefficient, in contrast to the reverse process, which is efficient. Our results establish fundamental limits on property testing and provide valuable insights into quantum pseudorandomness.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"31 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144211351","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
Building a fusion-based quantum computer using teleported gates 利用传送门构建基于融合的量子计算机
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-04 DOI: 10.22331/q-2025-06-04-1762
Ashot Avanesov, Alexander Shurinov, Ivan Dyakonov, Stanislav Straupe
{"title":"Building a fusion-based quantum computer using teleported gates","authors":"Ashot Avanesov, Alexander Shurinov, Ivan Dyakonov, Stanislav Straupe","doi":"10.22331/q-2025-06-04-1762","DOIUrl":"https://doi.org/10.22331/q-2025-06-04-1762","url":null,"abstract":"We adopt a method of the quantum gate teleportation for converting circuit-based quantum computation primitives into fusion networks. By using the presented scheme for the CNOT gate we construct translation of the circuit for the foliated surface code into a fault tolerant fusion network. Finally, we construct two new fusion based quantum computation models and study their fault tolerance properties.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"16 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144211354","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
How to avoid (apparent) signaling in Bell tests 如何在贝尔测试中避免（明显的）信号
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-04 DOI: 10.22331/q-2025-06-04-1760
Massimiliano Smania, Matthias Kleinmann, Adán Cabello, Mohamed Bourennane
{"title":"How to avoid (apparent) signaling in Bell tests","authors":"Massimiliano Smania, Matthias Kleinmann, Adán Cabello, Mohamed Bourennane","doi":"10.22331/q-2025-06-04-1760","DOIUrl":"https://doi.org/10.22331/q-2025-06-04-1760","url":null,"abstract":"Bell tests have become a powerful tool for quantifying security, randomness, entanglement, and many other properties, as well as for investigating fundamental physical limits. In all these cases, the specific experimental value of the Bell parameter is important as it leads to a quantitative conclusion. However, experimental implementations can also produce experimental data with (apparent) signaling. This signaling can be attributed to systematic errors occurring due to weaknesses in the experimental designs. Here we point out the importance, for quantitative applications, to identify and address this problem. We present a set of experiments with polarization-entangled photons in which we identify common sources of systematic errors and demonstrate approaches to avoid them. In addition, we establish the highest experimental value for the Bell-CHSH parameter obtained after applying strategies to minimize signaling that we are aware of: $S = 2.812 pm 0.003$ and negligible systematic errors. The experiments did not randomize the settings and did not close the locality loophole.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"9 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144211352","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
Quantum DeepONet: Neural operators accelerated by quantum computing 量子深度网络：由量子计算加速的神经算子
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-06-04 DOI: 10.22331/q-2025-06-04-1761
Pengpeng Xiao, Muqing Zheng, Anran Jiao, Xiu Yang, Lu Lu
{"title":"Quantum DeepONet: Neural operators accelerated by quantum computing","authors":"Pengpeng Xiao, Muqing Zheng, Anran Jiao, Xiu Yang, Lu Lu","doi":"10.22331/q-2025-06-04-1761","DOIUrl":"https://doi.org/10.22331/q-2025-06-04-1761","url":null,"abstract":"In the realm of computational science and engineering, constructing models that reflect real-world phenomena requires solving partial differential equations (PDEs) with different conditions. Recent advancements in neural operators, such as deep operator network (DeepONet), which learn mappings between infinite-dimensional function spaces, promise efficient computation of PDE solutions for a new condition in a single forward pass. However, classical DeepONet entails quadratic complexity concerning input dimensions during evaluation. Given the progress in quantum algorithms and hardware, here we propose to utilize quantum computing to accelerate DeepONet evaluations, yielding complexity that is linear in input dimensions. Our proposed quantum DeepONet integrates unary encoding and orthogonal quantum layers. We benchmark our quantum DeepONet using a variety of PDEs, including the antiderivative operator, advection equation, and Burgers' equation. We demonstrate the method's efficacy in both ideal and noisy conditions. Furthermore, we show that our quantum DeepONet can also be informed by physics, minimizing its reliance on extensive data collection. Quantum DeepONet will be particularly advantageous in applications in outer loop problems which require exploring parameter space and solving the corresponding PDEs, such as uncertainty quantification and optimal experimental design.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"8 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144211510","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学术文献互助群
群 号：481959085
Book学术官方微信