首页/论文/0809.2037

arXiv 0809.20372008-09-11quant-ph

The Efficiency of Quantum Identity Testing of Multiple States

Masaru Kada, Harumichi Nishimura, Tomoyuki Yamakami

备注：: 13pages
发表信息：: J. Phys. A: Math. Theor. 41 (2008) 395309
DOI：: 10.1088/1751-8113/41/39/395309

英文摘要：

We examine two quantum operations, the Permutation Test and the Circle Test, which test the identity of n quantum states. These operations naturally extend the well-studied Swap Test on two quantum states. We first show the optimality of the Permutation Test for any input size n as well as the optimality of the Circle Test for three input states. In particular, when n=3, we present a semi-classical protocol, incorporated with the Swap Test, which approximates the Circle Test efficiently. Furthermore, we show that, with help of classical preprocessing, a single use of the Circle Test can approximate the Permutation Test efficiently for an arbitrary input size n.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Sample optimal Quantum identity testing via Pauli Measurements

In this paper, we show that $Θ(\mathrm{poly}(n)\cdot\frac{4^n}{ε^2})$ is the sample complexity of testing whether two $n$-qubit quantum states $ρ$ and $σ$ are identical or $ε$-far in trace distance using two-outcome Pauli measurements.

2020-09-24quant-ph

Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing

We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to the question of tripartite to bipartite entanglement transformations.

2009-08-04quant-ph

量子程序黑盒测试中的等价性、同一性与幺正性检查

Equivalence, Identity, and Unitarity Checking in Black-Box Testing of Quantum Programs

本文提出三种新算法，解决量子程序黑盒测试中的等价性、同一性和幺正性检查问题，并优化参数选择，实验验证其有效性。

2024-05-24cs.SEquant-ph

Unitary Subgroup Testing

We consider the problem of $\textit{subgroup testing}$ for a quantum circuit $C$: given access to $C$, determine whether it implements a unitary that is $a$-close or $b$-far from a subgroup $\mathcal{G}$ of the unitary group. It encompasses the problem of exact testing, property testing and tolerant testing. In this work, we study these problems with the group $\mathcal{G}$ as the trivial subgroup (i.e. identity testing) or the Pauli or Clifford group and their $q$-ary extension, and a $\textit{promise}$ version of these problems where $C$ is promised to be in some subgroup of the unitaries th…

2022-11-22cs.CCquant-ph

测试量子态集合的同一性：样本复杂度分析

Testing identity of collections of quantum states: sample complexity analysis

研究在已知概率样本访问下测试未知量子态集合同一性的问题，证明基数为N的d维量子态集合样本复杂度为O(√N d/ε²)且有匹配下界，通过推广Hilbert-Schmidt距离估计器实现测试。

2023-09-07cs.DSquant-ph

高效量子态同一性检验

Efficient Quantum State Identity Testing

National Taiwan University（国立台湾大学）

针对量子态同一性检验问题，提出两种算法：常数深度并行交换测试和基于Schur变换的样本最优算法，并证明匹配下界，实现最优样本复杂度。

2026-10-06quant-ph

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

Quantum Closeness Testing: A Streaming Algorithm and Applications

One of the main subjects of this paper is to study quantum property testing with local measurement. In particular, we establish a novel $\ell_2$ norm connection between quantum property testing problems and the corresponding distribution testing problems. This connection opens up the potential to derive efficient testing algorithms using techniques developed for classical property testing. As the first demonstration of these possibilities, we designed two streaming algorithms: one for quantum state tomography, the other for quantum closeness testing. By using the idea of our tomography algorit…

2020-01-12quant-ph

Testing random-detector-efficiency countermeasure in a commercial system reveals a breakable unrealistic assumption

In the last decade, efforts have been made to reconcile theoretical security with realistic imperfect implementations of quantum key distribution (QKD). Implementable countermeasures are proposed to patch the discovered loopholes. However, certain countermeasures are not as robust as would be expected. In this paper, we present a concrete example of ID Quantique's random-detector-efficiency countermeasure against detector blinding attacks. As a third-party tester, we have found that the first industrial implementation of this countermeasure is effective against the original blinding attack, bu…

2016-10-18quant-ph

Testing quantum nonlocality by generalized quasiprobability functions

We derive a Bell inequality based on a generalized quasiprobability function which is parameterized by one non-positive real value. Two types of known Bell inequalities formulated in terms of the Wigner and Q functions are included as limiting cases. We investigate violations of our Bell inequalities for single photon entangled states and two-mode squeezed vacuum states when varying the detector efficiency. We show that the Bell inequality for the Q function allows the lowest detection efficiency for violations of local realism.

2009-08-04quant-ph

平均情况距离下的量子信道测试

Quantum Channel Testing in Average-Case Distance

该研究针对最坏情况钻石范数下量子信道恒等性测试复杂度高的问题，提出平均情况模仿钻石（ACID）范数，推导了不同模型下的查询复杂度界及信道层析成像的紧界。

2024-10-06cs.CCcs.DSquant-ph

用最优样本预测量子动力学的对称性

Predicting symmetries of quantum dynamics with optimal samples

提出结合群表示论与子群假设检验的统一框架，以最优样本复杂度预测量子动力学对称性，并证明并行策略性能等同自适应协议。

2025-02-03cs.ITmath.ITquant-ph

Quantum conditional query complexity

We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain speed-ups over the best known quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of these oracles for testing properties of boolean functions, and obtain an algorithm for checking whether an $n$-input $m$-output boolean function is balanced or $ε$-far from balanced; and (c) give a sub-lin…

2016-09-06cs.DSquant-ph

On the Chernoff bound for efficiency of quantum hypothesis testing

The paper estimates the Chernoff rate for the efficiency of quantum hypothesis testing. For both joint and separable measurements, approximate bounds for the rate are given if both states are mixed and exact expressions are derived if at least one of the states is pure. The efficiency of tests with separable measurements is found to be close to the efficiency of tests with joint measurements. The results are illustrated by a test of quantum entanglement.

2003-08-08math-phmath.MPmath.ST

Ward-Takahashi恒等式与开放量子系统的规范不变响应理论

Ward-Takahashi Identity and Gauge-Invariant Response Theory for Open Quantum Systems

本文推导了开放量子系统的Ward-Takahashi恒等式，并提出了一种规范不变响应理论，展示了粒子数守恒并非必要，并揭示了低能集体模的形成机制。

2026-02-14cond-mat.quant-gascond-mat.stat-mechquant-ph

分布与量子态高效测试的密码学条件

Cryptographic Conditions for Efficient Testing of Distributions and Quantum States

本文研究了在现实设定下分布测试的效率问题，证明多项式样本足以验证分布，并探讨了经典和量子可采样的分布计算复杂性，同时展示了Kolmogorov复杂性的应用。

2026-05-14cs.CCcs.CRquant-ph