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

Analysis of π0, KS0, and η fragmentation functions using single-inclusive annihilation data including BESIII measurements

引用

Physical Review D 2025年第3期111卷 034030-034030页

作者： Mengyang Li Daniele Paolo Anderle Hongxi Xing Yuxiang Zhao Key Laboratory of Atomic and Subatomic Structure and Quantum Control (MOE) Guangdong Basic Research Center of Excellence for Structure and Fundamental Interactions of Matter Institute of Quantum Matter South China Normal University Guangzhou 510006 China Guangdong-Hong Kong Joint Laboratory of Quantum Matter Guangdong Provincial Key Laboratory of Nuclear Science Southern Nuclear Science Computing Center South China Normal University Guangzhou 510006 China Southern Center for Nuclear-Science Theory (SCNT) Institute of Modern Physics Chinese Academy of Sciences Huizhou 516000 China Institute of Modern Physics Chinese Academy of Sciences Lanzhou 730000 China University of Chinese Academy of Sciences Beijing 100049 China Key Laboratory of Quark and Lepton Physics (MOE) and Institute of Particle Physics Central China Normal University Wuhan 430079 China

This study presents a quantum chromodynamics (QCD) analysis of fragmentation functions (FFs) for neutral pions (π0), neutral kaons (KS0), and eta mesons (η), utilizing world data of single-inclusive hadron production in e+e− annihilation involving the most recent BESIII data with low collision energy, to test the operational region of QCD collinear factorization for single-inclusive hadron production. We found that the QCD-based analysis at next-to-next-to-leading order in perturbative QCD with parametrized higher-twist effects can explain both existing high-energy world data and the BESIII new measurements, while the latter cannot be explained with existing FFs extracted with high-energy data. To investigate the higher-twist contributions to this discrepancy, a direct functional approach is employed, providing a testing framework for characterizing the experimental results over a wide range of energy scales, from low to high, thus extending the classical theoretical models to the BESIII domain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Characterizing the spatial potential of a surface electrode ion trap

arXiv

引用

arXiv 2023年

作者： Qin, Qingqing Chen, Ting Zhang, Xinfang Ou, Baoquan Zhang, Jie Wu, Chunwang Xie, Yi Wu, Wei Chen, Pingxing College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Mechanism and Technology of Quantum Information Hunan Changsha410073 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science National University of Defense Technology Changsha410073 China

The accurate characterization of the spatial potential generated by a planar electrode in a surface-type Paul trap is of great interest. To achieve this, we employ a simple yet highly precise parametric expression to describe the spatial field of a rectangular-shaped electrode. Based on this, an optimization method is introduced to precisely characterize the axial electric field intensity created by the powered electrode and the stray field. In contrast to existing methods, various types of experimental data, such as the equilibrium position of ions in a linear string, equilibrium positions of single trapped ions and trap frequencies, are utilized for potential estimation in order to mitigate systematic errors. This approach offers significant flexibility in voltage settings for data collection, making it particularly well-suited for surface electrode traps where ion probe trapping height may vary with casual voltage settings. In our demonstration, we successfully minimized the discrepancy between experimental observations and model predictions to an impressive extent. The relative errors of secular frequencies were suppressed within ±0.5%, and the positional error of ions was limited to less than 1.2 µm, all surpassing those achieved by existing methodologies. Copyright © 2023, The Authors. All rights reserved.

关键词： Electrodes

来源：评论

学校读者我要写书评

暂无评论

Benchmarking quantum optimization for the maximum-cut problem on a superconducting quantum computer

引用

Physical Review Applied 2025年第1期23卷 014045-014045页

作者： Maxime Dupont Bhuvanesh Sundar Bram Evert David E. Bernal Neira Zedong Peng Stephen Jeffrey Mark J. Hodson Rigetti Computing 775 Heinz Avenue Berkeley California 94710 USA Davidson School of Chemical Engineering Purdue University West Lafayette Indiana 47907 USA Universities Space Research Association (USRA) Research Institute for Advanced Computer Science Mountain View California 94043 USA Quantum AI Laboratory NASA Ames Research Center Moffett Field California 94035 USA

Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting quantum computer, we experimentally investigate the performance of a hybrid quantum-classical algorithm inspired by semidefinite programming approaches for solving the maximum-cut problem on 3-regular graphs up to several thousand variables. We leverage the structure of the input problems to address sizes beyond what current quantum machines can naively handle. We attain an average approximation ratio of 99% over a random ensemble of thousands of problem instances. We benchmark the quantum solver against similarly high-performing classical heuristics, including the gurobi optimizer, simulated annealing, and the Burer-Monteiro algorithm. A run-time analysis shows that the quantum solver on large-scale problems is competitive against gurobi but short of others on a projected 100-qubit quantum computer. We explore multiple leads to close the gap and discuss prospects for a practical quantum speedup.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Distributed exact quantum algorithms for Bernstein-Vazirani and search problems

arXiv

引用

arXiv 2023年

作者： Zhou, Xu Qiu, Daowen Luo, Le Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China The Guangdong Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou510006 China School of Physics and Astronomy Sun Yat-sen University Zhuhai519082 China QUDOOR Technologies Inc. Zhuhai519099 China

Distributed quantum computation has gained extensive attention since small-qubit quantum computers seem to be built more practically in the noisy intermediate-scale quantum (NISQ) era. In this paper, we give a distributed Bernstein-Vazirani algorithm (DBVA) with t computing nodes, and a distributed exact Grover’s algorithm (DEGA) that solve the search problem with only one target item in the unordered databases. Though the designing techniques are simple in the light of BV algorithm, Grover’s algorithm, the improved Grover’s algorithm by Long, and the distributed Grover’s algorithm by Qiu et al, in comparison to BV algorithm, the circuit depth of DBVA is not greater than 2max(n0,n1,··· ,nt−1) + 3 instead of 2n + 3, and the circuit depth of DEGA is 8(n mod 2) + 9, which is less than the circuit depth of Grover’s algorithm, (formula presented). In particular, we provide situations of our DBVA and DEGA on Mindquantum (a quantum software) to validate the correctness and practicability of our methods. By simulating the algorithms running in the depolarized channel, it further illustrates that distributed quantum algorithm has superiority of resisting noise. Copyright © 2023, The Authors. All rights reserved.

关键词： quantum theory

来源：评论

学校读者我要写书评

暂无评论

Experimental Demonstration of Inequivalent Mutually Unbiased Bases

arXiv

引用

arXiv 2023年

作者： Yan, Wen-Zhe Li, Yunting Hou, Zhibo Zhu, Huangjun Xiang, Guo-Yong Li, Chuan-Feng Guo, Guang-Can CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China CAS Center For Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei230026 China State Key Laboratory of Surface Physics Department of Physics Fudan University Shanghai200433 China Institute for Nanoelectronic Devices and Quantum Computing Fudan University Shanghai200433 China Center for Field Theory and Particle Physics Fudan University Shanghai200433 China

quantum measurements based on mutually unbiased bases (MUB) play crucial roles in foundational studies and quantum information processing. It is known that there exist inequivalent MUB, but little is known about their operational distinctions, not to say experimental demonstration. In this work, by virtue of a simple estimation problem we experimentally demonstrate the operational distinctions between inequivalent triples of MUB in dimension 4 based on high-precision photonic systems. The experimental estimation fidelities coincide well with the theoretical predictions with only 0.16% average deviation, which is 25 times less than the difference (4.1%) between the maximum estimation fidelity and the minimum estimation fidelity. Our experiments clearly demonstrate that inequivalent MUB have different information extraction capabilities and different merits for quantum information processing. © 2023, CC BY.

关键词： quantum optics

来源：评论

学校读者我要写书评

暂无评论

quantum computing of chirality imbalance in SU(2) gauge theory

引用

Physical Review D 2025年第5期111卷 056031-056031页

作者： Guofeng Zhang Xingyu Guo Enke Wang Hongxi Xing Key Laboratory of Atomic and Subatomic Structure and Quantum Control (MOE) Guangdong Basic Research Center of Excellence for Structure and Fundamental Interactions of Matter Institute of Quantum Matter South China Normal University Guangzhou 510006 China Guangdong-Hong Kong Joint Laboratory of Quantum Matter Guangdong Provincial Key Laboratory of Nuclear Science Southern Nuclear Science Computing Center South China Normal University Guangzhou 510006 China Southern Center for Nuclear-Science Theory (SCNT) Institute of Modern Physics Chinese Academy of Sciences Huizhou 516000 China

We implement a variational quantum algorithm to investigate the chiral condensate in a 1+1 dimensional SU(2) non-Abelian gauge theory. The algorithm is evaluated using a proposed Monte Carlo sampling method, which allows the extension to large qubit systems. The obtained results through quantum simulations on classical and actual quantum hardware are in good agreement with exact diagonalization of the lattice Hamiltonian, revealing the phenomena of chiral symmetry breaking and restoration as functions of both temperature and chemical potential. Our findings underscore the potential of near-term quantum computing for exploring QCD systems at finite temperature and density in non-Abelian gauge theories.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach

arXiv

引用

arXiv 2024年

作者： Ding, Zhiyan Junge, Marius Schleich, Philipp Wu, Peixue Department of Mathematics University of California Berkeley United States Department of Mathematics University of Illinois at Urbana and Champaign United States Department of Computer Science University of Toronto Canada Department of Applied Mathematics University of Waterloo Canada Institute for Quantum Computing University of Waterloo Canada

Simulating quantum dynamics is one of the most promising applications of quantum computers. While the upper bound of the simulation cost has been extensively studied through various quantum algorithms, much less work has focused on establishing the lower bound, particularly for the simulation of open quantum system dynamics. In this work, we present a general framework to calculate the lower bound for simulating a broad class of quantum Markov semigroups. Given a fixed accessible unitary set, we introduce the concept of convexified circuit depth to quantify the quantum simulation cost and analyze the necessary circuit depth to construct a quantum simulation scheme that achieves a specific order. Our framework can be applied to both unital and non-unital quantum dynamics, and the tightness of our lower bound technique is illustrated by showing that the upper and lower bounds coincide in several examples. © 2024, CC BY.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Provably Efficient Simulation of 1D Long-Range Interacting Systems at Any Temperature

引用

Physical Review Letters 2025年第19期134卷 190404-190404页

作者： Rakesh Achutha Donghoon Kim Yusuke Kimura Tomotaka Kuwahara Analytical quantum complexity RIKEN Hakubi Research Team RIKEN Center for Quantum Computing (RQC) Wako Saitama 351-0198 Japan Department of Computer Science and Engineering Indian Institute of Technology (Banaras Hindu University) Varanasi 221005 India PRESTO Japan Science and Technology (JST) Kawaguchi Saitama 332-0012 Japan RIKEN Cluster for Pioneering Research (CPR) Wako Saitama 351-0198 Japan

We introduce a method that ensures efficient computation of one-dimensional quantum systems with long-range interactions across all temperatures. Our algorithm operates within a quasipolynomial run-time for inverse temperatures up to β=poly(ln(n)). At the core of our approach is the density matrix renormalization group algorithm, which typically does not guarantee efficiency. We have created a new truncation scheme for the matrix product operator of the quantum Gibbs states, which allows us to control the error analytically. Additionally, our method can be applied to simulate the time evolution of systems with long-range interactions, achieving significantly better precision than that offered by the Lieb-Robinson bound.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Linear Convergence in Hilbert's Projective Metric for computing Augustin Information and a Rényi Information Measure

arXiv

引用

arXiv 2024年

作者： Tsai, Chung-En Wang, Guan-Ren Cheng, Hao-Chung Li, Yen-Huan Department of Computer Science and Information Engineering National Taiwan University Taiwan Graduate Institute of Networking and Multimedia National Taiwan University Taiwan Department of Electrical Engineering Graduate Institute of Communication Engineering National Taiwan University Taiwan Department of Mathematics National Taiwan University Taiwan Center for Quantum Science and Engineering National Taiwan University Taiwan Physics Division National Center for Theoretical Sciences Taiwan Quantum Computing Centre Taiwan

Consider the problems of computing the Augustin information and a Rényi information measure of statistical independence, previously explored by Lapidoth and Pfister (IEEE Information theory Workshop, 2018) and Tomamichel and Hayashi (IEEE Trans. Inf. theory, 64(2):1064-1082, 2018). Both quantities are defined as solutions to optimization problems and lack closed-form expressions. This paper analyzes two iterative algorithms: Augustin's fixed-point iteration for computing the Augustin information, and the algorithm by Kamatsuka et al. (arXiv:2404.10950) for the Rényi information measure. Previously, it was only known that these algorithms converge asymptotically. We establish the linear convergence of Augustin's algorithm for the Augustin information of order α ∈ (1/2, 1) ∪ (1, 3/2) and Kamatsuka et al.'s algorithm for the Rényi information measure of order α ∈ [1/2, 1) ∪ (1,∞), using Hilbert's projective metric. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Pauli error estimation via population recovery 16

Pauli error estimation via population recovery

引用

16th Conference on the theory of quantum Computation, Communication and Cryptography, TQC 2021

作者： Flammia, Steven T. O'Donnell, Ryan AWS Center for Quantum Computing PasadenaCA United States IQIM California Institute of Technology PasadenaCA United States Computer Science Department Carnegie Mellon University PittsburghPA United States

ISBN: (纸本)9783959771986

Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the "Population Recovery" problem, we give an extremely simple algorithm that learns the Pauli error rates of an n-qubit channel to precision ϵ in ∞ using just O(1/ϵ2) log(n/ϵ) applications of the channel. This is optimal up to the logarithmic factors. Our algorithm uses only unentangled state preparation and measurements, and the post-measurement classical runtime is just an O(1/ϵ) factor larger than the measurement data size. It is also impervious to a limited model of measurement noise where heralded measurement failures occur independently with probability ≤ 1/4. We then consider the case where the noise channel is close to the identity, meaning that the no-error outcome occurs with probability 1 − η. In the regime of small η we extend our algorithm to achieve multiplicative precision 1 ± ϵ (i.e., additive precision ϵη) using just O(ϵ21η ) log(n/ϵ) applications of the channel. © Steven T. Flammia and Ryan O'Donnell;licensed under Creative Commons License CC-BY 4.0

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：