检索结果-内蒙古大学图书馆

30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2025

作者： Stein, Samuel Xu, Shifan Cross, Andrew W. Yoder, Theodore J. Javadi-Abhari, Ali Liu, Chenxu Liu, Kun Zhou, Zeyuan Guinn, Charlie Ding, Yufei Ding, Yongshan Li, Ang Future Computing Technologies Pacific Northwest National Laboratory RichlandWA United States Departments of Applied Physics Yale Quantum Institute Yale University New HavenCT United States Ibm Quantum Ibm T.J Watson Research Center Yorktown HeightsNY United States Department of Physics Princeton University PrincetonNJ United States Department of Computer Science and Engineering University of California San Diego San DiegoCA United States Departments of Applied Physics Yale Quantum Institute Department of Computer Science Yale University New HavenCT United States Department of Electrical and Computer Engineering University of Washington SeattleWA United States

ISBN: (纸本)9798400710797

quantum Error Correction (QEC) is essential for future quantum computers due to its ability to exponentially suppress physical errors. The surface code is a leading error-correcting code candidate because of its local topological structure, experimentally achievable thresholds, and support for universal gate operations with magic states. However, its physical overhead scales quadratically with number of correctable errors. Conversely, quantum low-density parity-check (qLDPC) codes offer superior scaling but lack, on their own, a clear path to universal logical computation. Therefore, it is becoming increasingly evident that there are significant advantages to designing architectures using multiple codes. Heterogeneous architectures provide a clear path to universal logical computation as well as the ability to access different resource trade offs. To address this, we propose integrating the surface code and gross code using an ancilla bus for inter-code data movement. This approach involves managing trade-offs, including qubit overhead, a constrained instruction set, and gross code (memory) routing and management. While our focus is on the gross-surface code architecture, our method is adaptable to any code combination and the constraints generated by that specific architecture. Motivated by the potential reduction of physical qubit overhead, an important feature in the realization of fault-tolerant computation, we perform the first full system study of heterogeneous error-correcting codes, discovering architectural trade-offs and optimizing around them. We demonstrate physical qubit reductions of up to 6.42x when executing an algorithm to a logical error rate, at the cost of up to a 3.43x increase in algorithm time. © 2025 ACM.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Kink movement on a periodic background

引用

Physical Review E 2025年第2期111卷 024203-024203页

作者： Tomasz Dobrowolski Jacek Gatlik Panayotis G. Kevrekidis Department of Computer Physics and Quantum Computing University of the National Education Commission in Krakow Podchorążych 2 30-084 Cracow Poland AGH University of Krakow Faculty of Physics and Applied Computer Science 30-059 Krakow Poland Department of Mathematics and Statistics University of Massachusetts Amherst Massachusetts 01003-4515 USA

The behavior of the kink in the sine-Gordon (sG) model in the presence of periodic inhomogeneity is studied. An ansatz is proposed that allows for the construction of a reliable effective model with two degrees of freedom. Effective models featuring very good agreement with the original field-theoretic partial differential equation are constructed, including in the nonperturbative region and for relativistic velocities. The numerical solutions of the sG model describing the evolution of the kink in the presence of a barrier as well as in the case of a periodic heterogeneity under the potential additional influence of a switched bias current and/or dissipation were obtained. The results of the field equation and the effective models were favorably compared. The effect of the choice of initial conditions in the field model on the agreement of the results with the effective model is also discussed.

关键词： sine-Gordon equation

来源：评论

学校读者我要写书评

暂无评论

Invariant Theory and Magic State Distillation

arXiv

引用

arXiv 2025年

作者： Kalra, Amolak Ratan Prakash, Shiroman Institute for Quantum Computing David R. Cheriton School of Computer Science University of Waterloo WaterlooON Canada Perimeter Institute for Theoretical Physics WaterlooON Canada Department of Physics and Computer Science Dayalbagh Educational Institute Agra India

MSC Codes 94B65We show that the performance of a linear self-orthogonal GF(4) code for magic state distillation of Bravyi and Kitaev's |T〉-state is characterized by its simple weight enumerator. We compute weight enumerators of all such codes with fewer than 20 qubits and find none whose threshold exceeds that of the 5-qubit code. Using constraints on weight enumerators from invariant theory and linear programming, we establish bounds on the exponent characterizing noise suppression of a |T〉-state distillation protocol. We also obtain new non-negativity constraints on such weight enumerators by demanding consistency of the associated magic state distillation routine. These constraints yield new bounds on the distances of classical Hermitian self-dual and maximal self-orthogonal linear GF(4) codes, notably proving the nonexistence of such codes with parameters [12m, 6m, 4m + 2]GF(4) Copyright © 2025, The Authors. All rights reserved.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Simultaneous information and energy transmission through quantum channels

引用

Physical Review A 2025年第1期111卷 012609-012609页

作者： Bishal Kumar Das Lav R. Varshney Vaibhav Madhok Department of Physics Indian Institute of Technology Madras Chennai 600036 India Centre for Quantum Information Communication and Computing (CQuICC) Indian Institute of Technology Madras Chennai 600036 India Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Urbana Illinois 61801 USA

The optimal rate at which information can be sent through a quantum channel when the transmitted signal must simultaneously carry some minimum amount of energy is characterized. To do so, we introduce the quantum-classical analog of the capacity-power function, and we generalize results in classical information theory for transmitting classical information through noisy channels. We show that the capacity-power function for a classical-quantum channel, for both unassisted and private protocol, is concave, and we also prove additivity for unentangled and uncorrelated ensembles of input signals for such channels. This implies that we do not need regularized formulas for calculation. We show that these properties also hold for all noiseless channels when we restrict the set of input states to be pure quantum states. For general channels, we geometrically prove that the capacity-power function is piecewise concave, with further support from numerical simulations. Further, we connect channel capacity to properties of random quantum states. In particular, we obtain analytical expressions for the capacity-power function for the case of noiseless channels using properties of random quantum states under an energy constraint and concentration phenomena in large Hilbert spaces.

关键词： quantum channel

来源：评论

学校读者我要写书评

暂无评论

On the Importance of Error Mitigation for quantum Computation

arXiv

引用

arXiv 2025年

作者： Aharonov, Dorit Alberton, Ori Arad, Itai Atia, Yosi Bairey, Eyal Brakerski, Zvika Cohen, Itsik Golan, Omri Gurwich, Ilya Kenneth, Oded Leviatan, Eyal Lindner, Netanel H. Melcer, Ron Aharon Meyer, Adiel Schul, Gili Shutman, Maor Qedma Quantum Computing Tel Aviv Israel The Benin School of Computer Science and Engineering Hebrew University Jerusalem Israel Centre for Quantum Technologies National University of Singapore Singapore Faculty of Mathematics and Computer Science Weizmann Institute of Science Israel Department of Physics Technion Haifa Israel

quantum error mitigation (EM) is a family of hybrid quantum-classical methods for eliminating or reducing the effect of noise and decoherence on quantum algorithms run on quantum hardware, without applying quantum error correction (EC). While EM has many benefits compared to EC, specifically that it requires no (or little) qubit overhead, this benefit comes with a painful price: EM seems to necessitate an overhead in quantum run time which grows as a (mild) exponent [1–4]. Accordingly, recent results show that EM alone cannot enable exponential quantum advantages (QAs), for an average variant of the expectation value estimation problem [5]. These works raised concerns regarding the role of EM in the road map towards QAs. We aim to demystify the discussion, and provide a clear picture of the role of EM in achieving QAs, both in the near and long term. We first propose a clear distinction between finite QA and asymptotic QA, which is crucial to the understanding of the question, and present the notion of circuit volume boost, which we claim is an adequate way to quantify the benefits of EM. Using these notions we can argue straightforwardly that EM is expected to have a significant role in achieving QAs. Specifically, that EM is likely to be the first error reduction method for useful finite QAs, before EC;that the first such QAs are expected to be achieved using EM in the very near future;and that EM is expected to maintain its important role in quantum computation even when EC will be routinely used – for as long as high-quality qubits remain a scarce resource. © 2025, CC BY.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Streaming quantum state purification for general mixed states

arXiv

引用

arXiv 2025年

作者： Grier, Daniel Leung, Debbie Li, Zhi Pashayan, Hakop Schaeffer, Luke Department of Mathematics Department of Computer Science and Engineering University of California San Diego United States Institute for Quantum Computing University of Waterloo Canada Perimeter Institute for Theoretical Physics Canada National Research Council of Canada Canada Dahlem Center for Complex Quantum Systems Freie Universität Berlin Germany Research Institute Taiwan Department of Computer Science Institute for Advanced Computer Studies Joint Center for Quantum Information and Computer Science University of Maryland United States

Given multiple copies of a mixed quantum state with an unknown, nondegenerate principal eigenspace, quantum state purification is the task of recovering a quantum state that is closer to the principal eigenstate. A streaming protocol relying on recursive swap tests has been proposed and analysed for noisy depolarized states with arbitrary dimension and noise level. Here, we show that the same algorithm applies much more broadly, enabling the purification of arbitrary mixed states with a nondegenerate principal eigenvalue. We demonstrate this through two approaches. In the first approach, we show that, given the largest two eigenvalues, the depolarized noise is the most difficult noise to purify for the recursive swap tests, thus the desirable bounds on performance and cost follow from prior work. In the second approach, we provide a new and direct analysis for the performance of purification using recursive swap tests for the more general noise. We also derive simple lower bounds on the sample complexity, showing that the recursive swap test algorithm attains optimal sample complexity (up to a constant factor) in the low-noise regime. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Functional matrix product state simulation of continuous variable quantum circuits

arXiv

引用

arXiv 2025年

作者： Michelsen, Andreas Bock Marqversen, Frederik K. Kastoryano, Michael Department of Computer Science IT University of Copenhagen Copenhagen SDK-2300 Denmark Kvantify Aps Copenhagen SDK-2300 Denmark Department of Physics and Astronomy Aarhus University Aarhus CDK-8000 Denmark Department of Computer Science University of Copenhagen Copenhagen ØDK-2100 Denmark AWS Center for Quantum Computing PasadenaCA91125 United States

We introduce a functional matrix product state (FMPS) based method for simulating the real-space representation of continuous-variable (CV) quantum computation. This approach efficiently simulates non-Gaussian CV systems by leveraging their functional form. By addressing scaling bottlenecks, FMPS enables more efficient simulation of shallow, multi-mode CV quantum circuits with non-Gaussian input states. The method is validated by simulating random shallow and cascaded circuits with highly non-Gaussian input states, showing superior performance compared to existing techniques, also in the presence of loss. © 2025, CC BY.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Efficiently Verifiable quantum Advantage on Near-Term Analog quantum Simulators

引用

PRX quantum 2025年第1期6卷 010341-010341页

作者： Zhenning Liu Dhruv Devulapalli Dominik Hangleiter Yi-Kai Liu Alicia J. Kollár Alexey V. Gorshkov Andrew M. Childs Joint Center for Quantum Information and Computer Science NIST/University of Maryland College Park Maryland 20742 USA Joint Quantum Institute NIST/University of Maryland College Park Maryland 20742 USA Department of Computer Science University of Maryland College Park Maryland 20742 USA Simons Institute for the Theory of Computing University of California at Berkeley California 94720 USA Applied and Computational Mathematics Division National Institute of Standards and Technology (NIST) Gaithersburg Maryland 20899 USA Department of Physics University of Maryland College Park Maryland 20742 USA Institute for Advanced Computer Studies University of Maryland College Park Maryland 20742 USA

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation, in which the verifier need only run an O(λ2)-time classical computation, and the prover need only prepare O(1) samples of a history state and perform O(λ2) single-qubit measurements, for a security parameter λ. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Sign Problem in Tensor-Network Contraction

引用

PRX quantum 2025年第1期6卷 010312-010312页

作者： Jielun Chen Jiaqing Jiang Dominik Hangleiter Norbert Schuch Department of Physics California Institute of Technology Pasadena California 91125 USA Computing and Mathematical Sciences Department (CMS) California Institute of Technology Pasadena California 91125 USA Joint Center for Quantum Information and Computer Science (QuICS) University of Maryland and National Institute of Standards and Technology (NIST) College Park Maryland 20742 USA Joint Quantum Institute (JQI) University of Maryland and NIST College Park Maryland 20742 USA University of Vienna Faculty of Mathematics Oskar-Morgenstern-Platz 1 1090 Wien Austria University of Vienna Faculty of Physics Boltzmanngasse 5 1090 Wien Austria

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D, and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1/D, confirming our observations. We conclude by investigating the computational difficulty of computing exp

关键词： Wave functions

来源：评论

学校读者我要写书评

暂无评论

Scalable and fault-tolerant preparation of encoded k-uniform states

arXiv

引用

arXiv 2025年

作者： Majidy, Shayan Hangleiter, Dominik Gullans, Michael J. Department of Physics Harvard University CambridgeMA02138 United States Simons Institute for the Theory of Computing University of California BerkeleyCA94720 United States Joint Center for Quantum Information and Computer Science University of Maryland NIST College ParkMD20742 United States

k-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of k-uniform states, at scale, faces major obstacles: verifying k-uniformity is as difficult as measuring code distances, and devising fault-tolerant preparation protocols further adds to the complexity. To address these challenges, we present a scalable, fault-tolerant method for preparing encoded k-uniform states, and we illustrate our approach using surface and color codes. We first present a technique to determine k-uniformity of stabilizer states directly from their stabilizer tableau. We then identify a family of Clifford circuits that ensures both fault tolerance and scalability in preparing these states. Building on the encoded k-uniform states, we introduce a hybrid physical–logical strategy that retains some of the error-protection benefits of logical qubits while lowering the overhead for implementing arbitrary gates compared to fully logical algorithms. We show that this hybrid approach can outperform fully physical implementations for resource-state preparation, as demonstrated by explicit constructions of k-uniform states. Copyright © 2025, The Authors. All rights reserved.

关键词： Color codes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：