Quantum最新文献

筛选
英文 中文
The Dirac Vacuum in Discrete Spacetime 离散时空中的狄拉克真空
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-09-03 DOI: 10.22331/q-2025-09-03-1845
Chaitanya Gupta, Anthony J. Short
{"title":"The Dirac Vacuum in Discrete Spacetime","authors":"Chaitanya Gupta, Anthony J. Short","doi":"10.22331/q-2025-09-03-1845","DOIUrl":"https://doi.org/10.22331/q-2025-09-03-1845","url":null,"abstract":"We consider introducing the Dirac sea in a quantum cellular automata model of fermions in discrete spacetime which approximates the Dirac equation in the continuum limit. However, if we attempt to fill up the `negative' energy states, we run into a problem. A new boundary is created between positive and negative energy states, at which pair creation seems energetically favourable. This happens because of the modular nature of energy in discrete time models. We then suggest a possible remedy by amending the model, in order to pull states away from the new boundary.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"19 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144930752","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
Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training 量子电路训练中穿越贫瘠高原的批线搜索策略
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-29 DOI: 10.22331/q-2025-08-29-1841
Jakab Nádori, Gregory Morse, Barna Fülöp Villám, Zita Majnay-Takács, Zoltán Zimborás, Péter Rakyta
{"title":"Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training","authors":"Jakab Nádori, Gregory Morse, Barna Fülöp Villám, Zita Majnay-Takács, Zoltán Zimborás, Péter Rakyta","doi":"10.22331/q-2025-08-29-1841","DOIUrl":"https://doi.org/10.22331/q-2025-08-29-1841","url":null,"abstract":"Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices. These approaches typically involve the training of parameterized quantum circuits through a classical optimization loop. However, they often encounter challenges attributed to the exponentially diminishing gradient components, known as the barren plateau (BP) problem. This work introduces a novel optimization approach designed to alleviate the adverse effects of BPs during circuit training. In contrast to conventional gradient descent methods with a small learning parameter, our approach relies on making a finite hops along the search direction determined on a randomly chosen subsets of the free parameters. The optimization search direction, together with the range of the search, is determined by the distant features of the cost-function landscape. This enables the optimization path to navigate around barren plateaus without the need for external control mechanisms. We have successfully applied our optimization strategy to quantum circuits comprising 21 qubits and 15000 entangling gates, demonstrating robust resistance against BPs. Additionally, we have extended our optimization strategy by incorporating an evolutionary selection framework, enhancing its ability to avoid local minima in the landscape. The modified algorithm has been successfully utilized in quantum gate synthesis applications, showcasing a significantly improved efficiency in generating highly compressed quantum circuits compared to traditional gradient-based optimization approaches.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"21 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144915811","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
Targeted Clifford logical gates for hypergraph product codes 目标Clifford逻辑门超图产品代码
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-29 DOI: 10.22331/q-2025-08-29-1842
Adway Patra, Alexander Barg
{"title":"Targeted Clifford logical gates for hypergraph product codes","authors":"Adway Patra, Alexander Barg","doi":"10.22331/q-2025-08-29-1842","DOIUrl":"https://doi.org/10.22331/q-2025-08-29-1842","url":null,"abstract":"Starting with an explicit framework for designing logical Clifford circuits for CSS codes, we construct logical gates for Hypergraph Product Codes. We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group. This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"25 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144915812","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
Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation 利用泡利误差传播减少概率误差消除的采样开销
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-29 DOI: 10.22331/q-2025-08-29-1840
Timon Scheiber, Paul Haubenwallner, Matthias Heller
{"title":"Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation","authors":"Timon Scheiber, Paul Haubenwallner, Matthias Heller","doi":"10.22331/q-2025-08-29-1840","DOIUrl":"https://doi.org/10.22331/q-2025-08-29-1840","url":null,"abstract":"Quantum error mitigation is regarded as a possible path to near-term quantum utility. The methods under the quantum error mitigation umbrella term, such as probabilistic error cancellation (PEC), zero-noise extrapolation (ZNE) or Clifford data regression (CDR) are able to significantly reduce the error for the estimation of expectation values, although at an exponentially scaling cost, i.e., in the sampling overhead. In this work, we present a method to reduce the sampling overhead of PEC through Pauli error propagation combined with classical preprocessing. Our findings indicate that this method significantly reduces sampling overheads for Clifford circuits, leveraging the well-defined interaction between the Clifford group and Pauli noise.<br/> Additionally, we show that the method is applicable to non-Clifford circuits, though with more limited effectiveness, primarily constrained by the number of non-Clifford gates present in the circuit. We further provide examples of Clifford sub-circuits commonly encountered in relevant calculations, such as resource state generation in measurement-based quantum computing.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"35 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144915810","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
Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis 本征态热化假设下量子吉布斯态制备的Lindblad工程
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-29 DOI: 10.22331/q-2025-08-29-1843
Eric Brunner, Luuk Coopmans, Gabriel Matos, Matthias Rosenkranz, Frederic Sauvage, Yuta Kikuchi
{"title":"Lindblad engineering for quantum Gibbs state preparation under the eigenstate thermalization hypothesis","authors":"Eric Brunner, Luuk Coopmans, Gabriel Matos, Matthias Rosenkranz, Frederic Sauvage, Yuta Kikuchi","doi":"10.22331/q-2025-08-29-1843","DOIUrl":"https://doi.org/10.22331/q-2025-08-29-1843","url":null,"abstract":"Building upon recent progress in Lindblad engineering for quantum Gibbs state preparation algorithms, we propose a simplified protocol that is shown to be efficient under the eigenstate thermalization hypothesis (ETH). The ETH reduces circuit overheads of the Lindblad simulation algorithm and ensures a fast convergence toward the target Gibbs state. Moreover, we show that the realized Lindblad dynamics exhibits an inherent resilience against stochastic noise, opening up the path to a first demonstration on quantum computers. We complement our claims with numerical studies of the algorithm's convergence in various regimes of the mixed-field Ising model. In line with our predictions, we observe a mixing time scaling polynomially with system size when the ETH is satisfied. In addition, we assess the impact of algorithmic and hardware-induced errors on the algorithm's performance by carrying out quantum circuit simulations of our Lindblad simulation protocol with a local depolarizing noise model. This work bridges the gap between recent theoretical advances in dissipative Gibbs state preparation algorithms and their eventual quantum hardware implementation.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"219 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144915813","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
Superposition detection and QMA with non-collapsing measurements 非坍缩测量的叠加检测和QMA
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-28 DOI: 10.22331/q-2025-08-28-1839
Roozbeh Bassirian, Kunal Marwaha
{"title":"Superposition detection and QMA with non-collapsing measurements","authors":"Roozbeh Bassirian, Kunal Marwaha","doi":"10.22331/q-2025-08-28-1839","DOIUrl":"https://doi.org/10.22331/q-2025-08-28-1839","url":null,"abstract":"We prove that $sf{QMA}$ where the verifier may also make a single $non-collapsing$ measurement [7] is equal to $sf{NEXP}$, resolving an open question of Aaronson [5]. We show this is a corollary to a modified proof of $sf{QMA+ = NEXP}$ [15]. At the core of many results inspired by Blier and Tapp [16] is an unphysical property testing problem deciding whether a quantum state is close to an element of a fixed basis.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"31 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144910864","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
Preparing low-variance states using a distributed quantum algorithm 使用分布式量子算法制备低方差状态
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-28 DOI: 10.22331/q-2025-08-28-1838
Xiaoyu Liu, Benjamin F. Schiffer, Jordi Tura
{"title":"Preparing low-variance states using a distributed quantum algorithm","authors":"Xiaoyu Liu, Benjamin F. Schiffer, Jordi Tura","doi":"10.22331/q-2025-08-28-1838","DOIUrl":"https://doi.org/10.22331/q-2025-08-28-1838","url":null,"abstract":"Quantum computers are a highly promising tool for efficiently simulating quantum many-body systems. The preparation of their eigenstates is of particular interest and can be addressed, e.g., by quantum phase estimation algorithms. The routine then acts as an effective filtering operation, reducing the energy variance of the initial state. In this work, we present a distributed quantum algorithm inspired by iterative phase estimation to prepare low-variance states. Our method uses a single auxiliary qubit per quantum device, which controls its dynamics, and a postselection strategy for a joint quantum measurement on such auxiliary qubits. In the multi-device case, the result of this measurement heralds the successful runs of the protocol. This allows us to demonstrate that our distributed algorithm reduces the energy variance faster compared to single-device implementations, thereby highlighting the potential of distributed algorithms for near-term and early fault-tolerant devices.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"300 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144910863","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
Resource-efficient algorithm for estimating the trace of quantum state powers 估计量子态功率轨迹的资源高效算法
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-27 DOI: 10.22331/q-2025-08-27-1832
Myeongjin Shin, Junseo Lee, Seungwoo Lee, Kabgyun Jeong
{"title":"Resource-efficient algorithm for estimating the trace of quantum state powers","authors":"Myeongjin Shin, Junseo Lee, Seungwoo Lee, Kabgyun Jeong","doi":"10.22331/q-2025-08-27-1832","DOIUrl":"https://doi.org/10.22331/q-2025-08-27-1832","url":null,"abstract":"Estimating the trace of quantum state powers, $text{Tr}(rho^k)$, for $k$ identical quantum states is a fundamental task with numerous applications in quantum information processing, including nonlinear function estimation of quantum states and entanglement detection. On near-term quantum devices, reducing the required quantum circuit depth, the number of multi-qubit quantum operations, and the copies of the quantum state needed for such computations is crucial. In this work, inspired by the Newton-Girard method, we significantly improve upon existing results by introducing an algorithm that requires only $mathcal{O}(widetilde{r})$ qubits and $mathcal{O}(widetilde{r})$ multi-qubit gates, where $widetilde{r} = minleft{text{rank}(rho), leftlceillnleft({2k}/{epsilon}right)rightrceilright}$. This approach is efficient, as it employs the $tilde{r}$-entangled copy measurement instead of the conventional $k$-entangled copy measurement, while asymptotically preserving the known sample complexity upper bound. Furthermore, we prove that estimating ${text{Tr}(rho^i)}_{i=1}^{tilde{r}}$ is sufficient to approximate $text{Tr}(rho^k)$ even for large integers $k gt widetilde{r}$. This leads to a rank-dependent complexity for solving the problem, providing an efficient algorithm for low-rank quantum states while also improving existing methods when the rank is unknown or when the state is not low-rank. Building upon these advantages, we extend our algorithm to the estimation of $text{Tr}(Mrho^k)$ for arbitrary observables and $text{Tr}(rho^k sigma^l)$ for multiple quantum states.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"16 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144905881","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
Riemannian quantum circuit optimization based on matrix product operators 基于矩阵积算子的黎曼量子电路优化
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-27 DOI: 10.22331/q-2025-08-27-1833
Isabel Nha Minh Le, Shuo Sun, Christian B. Mendl
{"title":"Riemannian quantum circuit optimization based on matrix product operators","authors":"Isabel Nha Minh Le, Shuo Sun, Christian B. Mendl","doi":"10.22331/q-2025-08-27-1833","DOIUrl":"https://doi.org/10.22331/q-2025-08-27-1833","url":null,"abstract":"We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our method imposes no symmetry assumptions, such as translational invariance, on the quantum systems. This technique is scalable to large systems through the use of a matrix product operator representation of the reference time evolution propagator. Our optimization routine is applied to various spin chains and fermionic systems described by the transverse-field Ising Hamiltonian, the Heisenberg Hamiltonian, and the spinful Fermi-Hubbard Hamiltonian. In these cases, our approach achieves a relative error improvement of up to four orders of magnitude for systems of 50 qubits, although our method is also applicable to larger systems. Furthermore, we demonstrate the versatility of our method by applying it to molecular systems, specifically lithium hydride, achieving an error improvement of up to eight orders of magnitude. This proof of concept highlights the potential of our approach for broader applications in quantum simulations.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"23 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144905882","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
Minimal criteria for continuous-variable genuine multipartite entanglement 连续变量真多部纠缠的最小准则
IF 6.4 2区 物理与天体物理
Quantum Pub Date : 2025-08-27 DOI: 10.22331/q-2025-08-27-1837
Olga Leskovjanová, Ladislav Mišta Jr.
{"title":"Minimal criteria for continuous-variable genuine multipartite entanglement","authors":"Olga Leskovjanová, Ladislav Mišta Jr.","doi":"10.22331/q-2025-08-27-1837","DOIUrl":"https://doi.org/10.22331/q-2025-08-27-1837","url":null,"abstract":"We derive a set of genuine multi-mode entanglement criteria for second moments of the quadrature operators. The criteria have a common form of the uncertainty relation between sums of variances of position and momentum quadrature combinations. A unique feature of the criteria is that the sums contain the least possible number of variances of at most two-mode combinations. The number of second moments we need to know to apply the criteria thus scales only linearly with the number of modes, as opposed to the quadratic scaling of the already existing criteria. Each criterion is associated with a tree graph, which allowed us to develop a direct method of construction of the criteria based solely on the structure of the underlying tree. The practicality of the proposed criteria is demonstrated by finding a number of examples of Gaussian states of up to six modes, whose genuine multi-mode entanglement is detected by them. The designed criteria are particularly suitable for verification of genuine multipartite entanglement in large multi-mode states or when only a set of two-mode nearest-neighbour marginal covariance matrices of the investigated state is available.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"19 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144905903","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学术官方微信