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

Iranian Journal of Science and Technology Transactions of Electrical Engineering

Quantum Algorithm for Numerical Computation Using Post-selection Measurement

Arnab Roy, Joseph L. Pachuau, Anish Kumar Saha

Published Mar 14, 2026• 0 citations
Publisher
DOI
10.1007/s40998-025-00910-6

Related papers

Automatic post-selection by ancillae thermalization

L. Wright, F. Barratt, James Dborin +2 more

Tasks such as classification of data and determining the ground state of a Hamiltonian cannot be carried out through purely unitary quantum evolution. Instead, the inherent nonunitarity of the measurement process must be harnessed. Post-selection and its extensions provide a way to do this. However, they make inefficient use of time resources---a typical computation might require $O({2}^{m})$ measurements over $m$ qubits to reach a desired accuracy and cannot be done intermittently on current (superconducting-based) NISQ devices. We propose a method inspired by thermalization that harnesses insensitivity to the details of the bath. We find a greater robustness to gate noise by coupling to this bath, with a similar cost in time and more qubits compared to alternate methods for inducing nonlinearity such as fixed-point quantum search for oblivious amplitude amplification. Post-selection on $m$ ancillae qubits is replaced with tracing out $O[log\ensuremath{\epsilon}/log(1\ensuremath{-}p)]$ (where $p$ is the probability of a successful measurement) to attain the same accuracy as the post-selection circuit. We demonstrate this scheme on the quantum perceptron, quantum gearbox, and phase estimation algorithm. This method is particularly advantageous on current quantum computers involving superconducting circuits.

arXiv:2010.04173•Physical Review Research•Aug 13, 2021•7 citations

Quantum computation: Algorithms and Applications

Chien‐Hung Cho, Chih-Yu Chen, Kuo-Chin Chen +6 more

Chinese Journal of Physics•May 8, 2021•56 citations

Increasing the efficiency of post-selection in direct measurement of the quantum wave function

Yong-Li Wen, Shanchao Zhang, Hui Yan +1 more

Direct weak or strong measurement of quantum wave function based on post-selections has been widely explored; however, the efficiency of the measurement is heavily limited by the success probability of post-selection. Here we propose a modified scheme to directly measure photon–s wave function by simply inserting a liquid crystal plate before the post-selection stage. Numerical simulations demonstrate that our modified method can significantly increase the efficiency of post selection. Our proposal would speed up the quantum wave function measurement with high resolution and high fidelity.

arXiv:2103.05884•Chinese Physics B•Aug 19, 2021•4 citations

Quantum Algorithms: Invited Talk

Umesh V. Vazirani

Lecture notes in computer science•Jan 1, 2002•0 citations

Relieving the post-selection problem by quantum singular value transformation

Hongyi Wang

Quantum measurement is a fundamental yet experimentally challenging ingredient of quantum information processing. Many recent studies on quantum dynamics focus on expectation values of nonlinear observables; however, their experimental measurement is hindered by the post-selection problem -- namely, the substantial overhead caused by uncontrollable measurement outcomes. In this work, we propose a post-selection--free experimental strategy based on a fully quantum approach. The key idea is to deterministically simulate the post-selected quantum states by applying quantum singular value transformation (QSVT) algorithms. For pure initial state post-selection, our method is a generalization of fixed-point amplitude amplification to arbitrary projective measurements, achieving an optimal quadratic speedup. We further extend this framework to mixed initial state post-selection by applying linear amplitude amplification via QSVT, which significantly enhances the measurement success probability. However, a deterministic quantum algorithm for preparing the post-selected mixed state is generally impossible because of information-theoretic constraints imposed by quantum coding theory. Additionally, we introduce a pseudoinverse decoder for measurement-induced quantum teleportation. This decoder possesses the novel property that, when conditioned on a successful flag measurement, the decoding is nearly perfect even in cases where channel decoders are information-theoretically impossible. Overall, our work establishes a powerful approach for measuring novel quantum dynamical phenomena and presents quantum algorithms as a new perspective for understanding quantum dynamics and quantum chaos.

arXiv:2504.00108•Mar 31, 2025•3 citations

Experimental realization of a quantum algorithm

Isaac L. Chuang, Lieven M. K. Vandersypen, Xinlan Zhou +2 more

arXiv:quant-ph/9801037•Nature•May 1, 1998•606 citations
Tasks such as classification of data and determining the ground state of a Hamiltonian cannot be carried out through purely unitary quantum evolution. Instead, the inherent nonunitarity of the measurement process must be harnessed. Post-selection and its extensions provide a way to do this. However, they make inefficient use of time resources---a typical computation might require O(2m)O({2}^{m})O(2m) measurements over mmm qubits to reach a desired accuracy and cannot be done intermittently on current (superconducting-based) NISQ devices. We propose a method inspired by thermalization that harnesses insensitivity to the details of the bath. We find a greater robustness to gate noise by coupling to this bath, with a similar cost in time and more qubits compared to alternate methods for inducing nonlinearity such as fixed-point quantum search for oblivious amplitude amplification. Post-selection on mmm ancillae qubits is replaced with tracing out $O[log\ensuremath{\epsilon}/log(1\ensuremath{-}p)]$ (where ppp is the probability of a successful measurement) to attain the same accuracy as the post-selection circuit. We demonstrate this scheme on the quantum perceptron, quantum gearbox, and phase estimation algorithm. This method is particularly advantageous on current quantum computers involving superconducting circuits.
Direct weak or strong measurement of quantum wave function based on post-selections has been widely explored; however, the efficiency of the measurement is heavily limited by the success probability of post-selection. Here we propose a modified scheme to directly measure photon–s wave function by simply inserting a liquid crystal plate before the post-selection stage. Numerical simulations demonstrate that our modified method can significantly increase the efficiency of post selection. Our proposal would speed up the quantum wave function measurement with high resolution and high fidelity.
Quantum measurement is a fundamental yet experimentally challenging ingredient of quantum information processing. Many recent studies on quantum dynamics focus on expectation values of nonlinear observables; however, their experimental measurement is hindered by the post-selection problem -- namely, the substantial overhead caused by uncontrollable measurement outcomes. In this work, we propose a post-selection--free experimental strategy based on a fully quantum approach. The key idea is to deterministically simulate the post-selected quantum states by applying quantum singular value transformation (QSVT) algorithms. For pure initial state post-selection, our method is a generalization of fixed-point amplitude amplification to arbitrary projective measurements, achieving an optimal quadratic speedup. We further extend this framework to mixed initial state post-selection by applying linear amplitude amplification via QSVT, which significantly enhances the measurement success probability. However, a deterministic quantum algorithm for preparing the post-selected mixed state is generally impossible because of information-theoretic constraints imposed by quantum coding theory. Additionally, we introduce a pseudoinverse decoder for measurement-induced quantum teleportation. This decoder possesses the novel property that, when conditioned on a successful flag measurement, the decoding is nearly perfect even in cases where channel decoders are information-theoretically impossible. Overall, our work establishes a powerful approach for measuring novel quantum dynamical phenomena and presents quantum algorithms as a new perspective for understanding quantum dynamics and quantum chaos.