Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2011.08487

Notes on distinguishability of postselected computations

Zuzana Gavorová

Published Nov 17, 2020• 3 citations
arXivHTMLPDF

Abstract

The framework of postselection is becoming more and more important in various recent directions in Quantum Computation research. Postselection renders simple computational models able to perform general quantum computation. This was first observed for the linear optics model [E. Knill, R. Laflamme, G. J. Milburn, Nature 409, 46 (2001)], and has since provided us with many near-term candidates for the quantum advantage, commuting computations [M. J. Bremner, R. Jozsa, D. J. Shepherd, Proc. R. Soc. A 467, 459 (2011)] being the first. To facilitate the discussion of errors in the presence of postselection, we define and characterize trace-induced distance and diamond distance of postselected computations. We show counterexamples to simple properties that one would expect of any distance measure; the properties of convexity (when considering only the pure-state inputs would suffice), contractivity, and subadditivity of errors. On the positive side, we prove that certain weaker versions of contractivity and subadditivity and a number of other properties are preserved in the postselected setting. We achieve this via a "conversion lemma" that translates any inequality from the standard to the postselected setting.

DOI
10.48550/arxiv.2011.08487

Related papers

Photon exchange interactions and quantum information processing

J. D. Franson

We previously suggested that photon exchange interactions could be used to produce nonlinear effects at the two-photon level, and similar effects have been experimentally observed by Resch et al. (e-print quant-ph/0306198). Here we note that photon exchange interactions are not useful for quantum information processing because they require the presence of substantial photon loss. This dependence on loss is somewhat analogous to the postselection required in the linear optics approach to quantum computing suggested by Knill, Laflamme, and Milburn [Nature (London) 409, 46 (2001)].

arXiv:quant-ph/0405141•Physical Review A•Nov 16, 2004•5 citations

Quantum computation with linear optics

Michael J. Fitch, Michelle M. Donegan, B. C. Jacobs +2 more

Ever since Knill, Laflamme and Milburn [Nature (London) 409, 46 (2001)] showed that nondeterministic quantum logic operations could be performed with linear optical elements, additional photons (ancilla) and projective measurements, the idea of linear-optics quantum computation has attracted considerable interest. Our group has recently demonstrated several devices of this kind. We give an overview of recent experimental results, including the quantum parity check, the destructive controlled-NOT, and a cyclical quantum memory. The need for high-efficiency detection of single photons, and for detectors capable of distinguishing photon number will be discussed. Some experimental improvements towards meeting that need will be presented.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•0 citations

Error-Minimizing Measurements in Postselected One-Shot Symmetric Quantum State Discrimination and Acceptance as a Performance Metric

Gupta, Saurabh Kumar, Abhishek Kr. Gupta

In hypothesis testing with quantum states, given a black box containing one of the two possible states, measurement is performed to detect in favor of one of the hypotheses. In postselected hypothesis testing, a third outcome is added, corresponding to not selecting any of the hypotheses. In postselected scenario, minimum error one-shot symmetric hypothesis testing is characterized in literature conditioned on the fact that one of the selected outcomes occur. We proceed further in this direction to give the set of all possible measurements that lead to the minimum error. We have given an arbitrary error-minimizing measurement in a parametric form. Note that not selecting any of the hypotheses decimates the quality of testing. We further give an example to show that these measurements vary in quality. There is a need to discuss the quality of postselected hypothesis testing. We then characterize the quality of postselected hypothesis testing by defining a new metric acceptance and give expression of acceptance for an arbitrary error-minimizing measurement in terms of some parameters of the measurement. On the set of measurements that achieve minimum error, we have maximized the acceptance, and given an example which achieves that, thus giving an example of the best possible measurement in terms of acceptance.

arXiv:2409.13379•Sep 20, 2024•0 citations

Proving the Power of Postselection

Abuzer Yakaryılmaz, A. C. Cem Say

It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition power of both probabilistic and quantum polynomial-time computers. It is also unknown whether polynomial-time quantum machine

arXiv:1111.3125•Fundamenta Informaticae•Jan 1, 2013•10 citations

A distance measure of non-trace-preserving channels

Yu Bo Shi, Edo Waks

The diamond distance can measure the error between real and ideal quantum processes. We can calculate the distance for trace-preserving channels using convex optimization. However, convex optimization cannot solve the distance for non-trace-preserving channels because they are nonlinear. We generalize the diamond distance for non-trace-preserving channels. We first compute the distance for a simple measurement and post-selection channel, then generalize the method to any non-trace-preserving channels. As an example, we analyze the Knill-Laflamme-Milburn (KLM) protocol in linear optical quantum computing with physical imperfections. Our method provides a well-behaved measure for general quantum channels, which can bridge the physical imperfections with the logical errors in quantum circuits. Hence, it has broad applications in analyzing real systems in quantum information processing, such as quantum computers, quantum teleportation, measurement-based quantum computation, etc.

•Oct 5, 2021•0 citations

On the Simulation of Adaptive Measurements via Postselection

Vikram Dhillon

In this note we address the question of whether any any quantum computational model that allows adaptive measurements can be simulated by a model that allows postselected measurements. We argue in the favor of this question and prove that adaptive measurements can be simulated by postselection. We also discuss some potentially stunning consequences of this result such as the ability to solve #P problems.

arXiv:1107.3271•Jul 17, 2011•0 citations
The framework of postselection is becoming more and more important in various recent directions in Quantum Computation research. Postselection renders simple computational models able to perform general quantum computation. This was first observed for the linear optics model [E. Knill, R. Laflamme, G. J. Milburn, Nature 409, 46 (2001)], and has since provided us with many near-term candidates for the quantum advantage, commuting computations [M. J. Bremner, R. Jozsa, D. J. Shepherd, Proc. R. Soc. A 467, 459 (2011)] being the first. To facilitate the discussion of errors in the presence of postselection, we define and characterize trace-induced distance and diamond distance of postselected computations. We show counterexamples to simple properties that one would expect of any distance measure; the properties of convexity (when considering only the pure-state inputs would suffice), contractivity, and subadditivity of errors. On the positive side, we prove that certain weaker versions of contractivity and subadditivity and a number of other properties are preserved in the postselected setting. We achieve this via a "conversion lemma" that translates any inequality from the standard to the postselected setting.
We previously suggested that photon exchange interactions could be used to produce nonlinear effects at the two-photon level, and similar effects have been experimentally observed by Resch et al. (e-print quant-ph/0306198). Here we note that photon exchange interactions are not useful for quantum information processing because they require the presence of substantial photon loss. This dependence on loss is somewhat analogous to the postselection required in the linear optics approach to quantum computing suggested by Knill, Laflamme, and Milburn [Nature (London) 409, 46 (2001)].
Ever since Knill, Laflamme and Milburn [Nature (London) 409, 46 (2001)] showed that nondeterministic quantum logic operations could be performed with linear optical elements, additional photons (ancilla) and projective measurements, the idea of linear-optics quantum computation has attracted considerable interest. Our group has recently demonstrated several devices of this kind. We give an overview of recent experimental results, including the quantum parity check, the destructive controlled-NOT, and a cyclical quantum memory. The need for high-efficiency detection of single photons, and for detectors capable of distinguishing photon number will be discussed. Some experimental improvements towards meeting that need will be presented.
In hypothesis testing with quantum states, given a black box containing one of the two possible states, measurement is performed to detect in favor of one of the hypotheses. In postselected hypothesis testing, a third outcome is added, corresponding to not selecting any of the hypotheses. In postselected scenario, minimum error one-shot symmetric hypothesis testing is characterized in literature conditioned on the fact that one of the selected outcomes occur. We proceed further in this direction to give the set of all possible measurements that lead to the minimum error. We have given an arbitrary error-minimizing measurement in a parametric form. Note that not selecting any of the hypotheses decimates the quality of testing. We further give an example to show that these measurements vary in quality. There is a need to discuss the quality of postselected hypothesis testing. We then characterize the quality of postselected hypothesis testing by defining a new metric acceptance and give expression of acceptance for an arbitrary error-minimizing measurement in terms of some parameters of the measurement. On the set of measurements that achieve minimum error, we have maximized the acceptance, and given an example which achieves that, thus giving an example of the best possible measurement in terms of acceptance.
The diamond distance can measure the error between real and ideal quantum processes. We can calculate the distance for trace-preserving channels using convex optimization. However, convex optimization cannot solve the distance for non-trace-preserving channels because they are nonlinear. We generalize the diamond distance for non-trace-preserving channels. We first compute the distance for a simple measurement and post-selection channel, then generalize the method to any non-trace-preserving channels. As an example, we analyze the Knill-Laflamme-Milburn (KLM) protocol in linear optical quantum computing with physical imperfections. Our method provides a well-behaved measure for general quantum channels, which can bridge the physical imperfections with the logical errors in quantum circuits. Hence, it has broad applications in analyzing real systems in quantum information processing, such as quantum computers, quantum teleportation, measurement-based quantum computation, etc.