arXiv 1503.075252015-03quant-ph

Estimating outcome probabilities of quantum circuits using quasiprobabilities

Hakop Pashayan, Joel J. Wallman, Stephen D. Bartlett

备注：: 5 pages + 1 page appendix, 1 figure, comments welcome; v2 published version
发表信息：: Phys. Rev. Lett. 115, 070501 (2015)
DOI：: 10.1103/PhysRevLett.115.070501

英文摘要：

We present a method for estimating the probabilities of outcomes of a quantum circuit using Monte Carlo sampling techniques applied to a quasiprobability representation. Our estimate converges to the true quantum probability at a rate determined by the total negativity in the circuit, using a measure of negativity based on the 1-norm of the quasiprobability. If the negativity grows at most polynomially in the size of the circuit, our estimator converges efficiently. These results highlight the role of negativity as a measure of non-classical resources in quantum computation.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Quasistates and quasiprobabilities

The quasiprobability representation of quantum states addresses two main concerns, the identification of nonclassical features and the decomposition of the density operator. While the former aspect is a main focus of current research, the latter decomposition property has been studied less frequently. In this contribution, we introduce a method for the generalized expansion of quantum states in terms of so-called quasistates. In contrast to the quasiprobability decomposition through nonclassical distributions and pure-state operators, our technique results in classical probabilities and nonpos…

2018-10-25quant-ph

关于Kirkwood–Dirac准概率与分配给紧框架的量子信道的 unraveling 研究

On Kirkwood--Dirac quasiprobabilities and unravelings of quantum channel assigned to a tight frame

本研究将Kirkwood–Dirac准概率与紧框架下的量子信道unraveling关联，利用紧框架矢量构造主Kraus算子生成准概率，刻画等角紧框架下准概率矩阵的范数，得到新型不确定关系与特征值位置不等式，并以二维对称信息完备测量验证其实用性。

2024-07-11quant-ph

Negative quasiprobabilities enhance phase estimation in quantum-optics experiment

Operator noncommutation, a hallmark of quantum theory, limits measurement precision, according to uncertainty principles. Wielded correctly, though, noncommutation can boost precision. A recent foundational result relates a metrological advantage with negative quasiprobabilities -- quantum extensions of probabilities -- engendered by noncommuting operators. We crystallize the relationship in an equation that we prove theoretically and observe experimentally. Our proof-of-principle optical experiment features a filtering technique that we term partially postselected amplification (PPA). Using P…

2021-11-08quant-ph

Quasiprobability distributions for quantum-optical coherence and beyond

We study the quasiprobability representation of quantum light, as introduced by Glauber and Sudarshan, for the unified characterization of quantum phenomena. We begin with reviewing the past and current impact of this technique. Regularization and convolution methods are specifically considered since they are accessible in experiments. We further discuss more general quantum systems for which the concept of negative probabilities can be generalized, being highly relevant for quantum information science. For analyzing quantum superpositions, we apply recently developed approaches to visualize q…

2020-02-10quant-ph

时空本征规则是准概率的

The spatiotemporal Born rule is quasiprobabilistic

School of Mathematics and Statistics, Hainan University（海南大学数学与统计学院）；School of Mathematical Sciences, MOE-LSC, Shanghai Jiao Tong University（上海交通大学数学科学学院，教育部线性代数与计算中心）；Shanghai Seres Information Technology Co., Ltd（上海思尔思信息技术有限公司）；Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology（南方科技大学深圳量子科学与工程研究院）

本文提出一种准概率描述，将量子理论中的时空本规则扩展到时间领域，并结合量子贝叶斯规则，为开放量子系统的时间反转对称性提供操作性定义。

2026-01-10quant-ph

Quantum supremacy and hardness of estimating output probabilities of quantum circuits

Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the non-collapse of the polynomial hierarchy that approximating the output probabilities of random quantum circuits to within $\exp(-Ω(m\log m))$ additive error is hard for any classical computer, where $m$ is the number of gates in the quantum computation. More precisely, we show that the above problem is $\#\mathsf{P}$-hard under $\mathsf{BPP}^{\mathsf{NP}}$ reduction. I…

2021-12-10quant-ph

更多相关论文收起更多论文

通过单线路测量概率估计约化密度矩阵幂的迹的显式公式

Explicit Formulas for Estimating Trace of Reduced Density Matrix Powers via Single-Circuit Measurement Probabilities

本文提出利用单量子线路和受控 SWAP 测试，通过显式公式同时估计约化密度矩阵 2 至 n 次幂的迹，并给出纯量子与量子-经典混合两种算法，在 GHZ 态和 W 态上验证了方法的有效性。

2025-07-23quant-ph

从综合征数据估计探测器错误模型

Estimating detector error models from syndrome data

本文提出从多轮综合征提取数据中估计探测器错误模型事件及其聚合类别概率的方法，以支持量子纠错中的错误识别与纠正。

2025-04-20quant-ph

Estimating Information Gain in Measurements in Suboptimal Bases for Quantum State Tomography

It is known that mutually unbiased bases, whenever they exist, are optimal in an information theoretic sense for the determination of unknown state of a quantum ensemble. These bases may not exist in most dimensions and some suboptimal choices have to be made. The present paper deals with estimates of the information loss in suboptimal choice of bases. The information is calculated directly in terms of transition probabilities. I give estimates for the information content of measurement in some approximate MUBs proposed recently.

2006-04-18quant-ph

On Estimating the State of a Finite Level Quantum System

We revisit the problem of mutually unbiased measurements in the context of estimating the unknown state of a $d$-level quantum system, first studied by W. K. Wootters and B. D. fields[7] in 1989 and later investigated by S. Bandyopadhyay et al [3] in 2001 and A. O. Pittenger and M. H. Rubin [6] in 2003. Our approach is based directly on the Weyl operators in the $L^2$-space over a finite field when $d=p^r$ is the power of a prime. When $d$ is not a prime power we sacrifice a bit of optimality and construct a recovery operator for reconstructing the unknown state from the probabilities of eleme…

2004-08-11quant-ph

Kirkwood-Dirac 准概率的边界

The boundary of Kirkwood-Dirac quasiprobability

本文通过引入后量子准概率作为外边界，证明经典概率、KD 准概率和后量子准概率构成严格层级，并推导出适用于任意数量测量的非平凡界限，深化了对 KD 准概率在量子信息处理中应用的理解。

2025-04-12quant-ph

Average-case hardness of estimating probabilities of random quantum circuits with a linear scaling in the error exponent

We consider the hardness of computing additive approximations to output probabilities of random quantum circuits. We consider three random circuit families, namely, Haar random, $p=1$ QAOA, and random IQP circuits. Our results are as follows. For Haar random circuits with $m$ gates, we improve on prior results by showing $\mathsf{coC_=P}$ hardness of average-case additive approximations to an imprecision of $2^{-O(m)}$. Efficient classical simulation of such problems would imply the collapse of the polynomial hierarchy. For constant depth circuits i.e., when $m=O(n)$, this linear scaling in th…

2022-06-12cs.CCquant-ph

Decompositions of Hilbert Spaces, Stability Analysis and Convergence Probabilities for Discrete-Time Quantum Dynamical Semigroups

We investigate convergence properties of discrete-time semigroup quantum dynamics, including asymptotic stability, probability and speed of convergence to pure states and subspaces. These properties are of interest in both the analysis of uncontrolled evolutions and the engineering of controlled dynamics for quantum information processing. Our results include two Hilbert space decompositions that allow for deciding the stability of the subspace of interest and for estimating of the speed of convergence, as well as a formula to obtain the limit probability distribution for a set of orthogonal i…

2015-01-02math-phmath.MPquant-ph

可视化量子电路概率——估计量子程序合成的计算动作

Visualizing Quantum Circuit Probability -- estimating computational action for quantum program synthesis

本研究将算法概率应用于布尔与量子组合逻辑电路，定义了计算电路模型中的状态概率，并在时空受限设定下枚举和可视化经典与量子门集的可达性与可表达性，探讨其在几何量子机器学习、量子算法合成及量子AGI中的潜在应用。

2023-04-05cs.CCcs.ITmath.IT