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:2010.04173 · Physical Review Research

Automatic post-selection by ancillae thermalization

L. Wright, F. Barratt, James Dborin, George H. Booth, Andrew G. Green

Published Aug 13, 2021• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevresearch.3.033151

Related papers

Variational post-selection for ground states and thermal states simulation

Shi‐Xin Zhang, Jiaqi Miao, Chang‐Yu Hsieh

Abstract Variational quantum algorithms, as one of the most promising routes in the noisy intermediate-scale quantum era, offer various potential applications while also confronting severe challenges due to near-term quantum hardware restrictions. In this work, we propose a framework to enhance the expressiveness of a variational quantum ansatz by incorporating variational post-selection techniques. These techniques apply variational modules and neural network post-processing on ancilla qubits, which are compatible with the current generation of quantum devices. Equipped with variational post-selection, we demonstrate that the accuracy of the variational ground state and thermal state preparation for both quantum spin and molecule systems is substantially improved. Notably, in the case of estimating the local properties of a thermalized quantum system, we present a scalable approach that outperforms previous methods through the combination of neural post-selection and a new optimization objective.

arXiv:2402.07605•Quantum Science and Technology•Nov 7, 2024•6 citations

Experimental Observation of Measurement-Induced Phase Transitions on NISQ Processors via Feedback-Stabilized Criticality

Angel Jose Toranzo Portela

Measurement-induced phase transitions (MIPT) offer a novel paradigm for exploring quantum criticality, yet their experimental observation remains stifled by the "post-selection problem"—the exponential cost of resolving quantum trajectories. Here, we propose a scalable protocol to observe feedback-stabilized criticality on current Noisy Intermediate-Scale Quantum (NISQ) processors, eliminating the need for post-selection. By coupling local measurements to real-time unitary feedback, we demonstrate that a many-body quantum system can be steered toward the universal 1/e information horizon, effectively turning the measurement back-action from a source of decoherence into a resource for complexity. Extensive numerical simulations incorporating realistic depolarizing noise reveal a robust stability plateau extending to gate error rates of p ≈ 10⁻², compatible with state-of-the-art superconducting architectures such as IBM Heron. Furthermore, we introduce a verification scheme based on classical shadows to efficiently estimate the Schmidt concentration ⟨K_c⟩ without full tomography. Our results establish that thermodynamic error correction is achievable in the NISQ era, providing a blueprint for the first experimental observation of a feedback-induced phase transition at the mesoscopic scale (N ~ 100).

•Jan 18, 2026•0 citations

Post-selection-based continuous variable quantum information processing

Jie Zhao

Quantum communication and computation harness the intriguing and bewildering nature of quantum mechanics to realize information processing tasks that have no classical analog. Nonetheless, this supremacy comes with fundamental limits that, in some scenarios, pose undesirable bounds on the performance of these quantum technologies. One such example is the well-known quantum no-cloning theorem imposed by the Heisenberg uncertainty principle. It states that an unknown quantum state cannot be duplicated with arbitrarily high accuracy. Very recently, however, post-selection was proposed as a way out: it was demonstrated that in various quantum information tasks, deterministic bounds can be overcome by forgoing determinism. In this thesis, we investigate post-selection as a novel approach to enhance the performance of versatile continuous-variable (CV) quantum information processing and envisage it to become a useful component of the general Gaussian toolbox. The first part of this thesis examines applications of post-selection in purely linear systems. In particular, two implementations of the noiseless linear amplifier (NLA), the measurement-based NLA and the physical NLA, are investigated and compared in terms to their abilities to preserve the state Gaussianity and their success probability. We show that the inevitable signal-to-noise ratio (SNR) degradation accompanying a linear quantum amplifier can be circumvented by resorting to a probabilistic scheme. Amplification with a signal transfer coefficient of Ts>1 is realised by combining a measurement-based NLA with a deterministic linear amplifier. We also construct a quantum cloning machine based on this hybrid amplifier for arbitrary coherent input states. We demonstrate a production of multiple clones (up to five) with fidelity of each clone exceeding the corresponding no-cloning limit. We then consider employing the post-selection algorithm in information protocols involving nonlinearity. First, we develop two squeezers as optical parametric amplifiers, each producing fairly pure squeezed output field up to 11.2dB (after correcting the detection loss). The squeezers are served as the nonlinear source in the remaining part of this thesis. We demonstrate a high fidelity quantum squeezing gate which is one indispensible building block for constructing a universal CV quantum computer. An inverse-Gaussian filter is incorporated into the feedforward line, leading to an enhancement in precision of the inline dual-homodyne measurement and therefore combats efficiently the correlation degradation due to loss and noise introduced during feedforward. As one example, we show that a fidelity of 98.49% for a target squeezing of -2.3dB is obtained with only -6dB ancilla squeezing, which would otherwise require -20.5dB initial squeezing using a conventional deterministic setup. Additionally, we introduce a CV quantum teleportation scheme using post-selection, allowing for a significantly improved fidelity against the conventional deterministic CV teleporter. The intuition behind this improvement is that post-selection effectively distilled the accessible entanglement and therefore a high fidelity only originally achievable with a higher amount of initial squeezing is now obtainable with only modest amount of squeezing, coming at an expense of finite success probability.

•Jan 1, 2019•1 citation

Double-bracket algorithm for quantum signal processing without post-selection

Yudai Suzuki, Bi Hong Tiang, Jeongrak Son +3 more

Quantum Signal Processing (QSP), a framework for implementing matrix-valued polynomials, is a fundamental primitive in various quantum algorithms. Despite its versatility, a potentially underappreciated challenge is that all systematic protocols for implementing QSP rely on post-selection. This can impose prohibitive costs for tasks when amplitude amplification cannot sufficiently improve the success probability. For example, in the context of ground-state preparation, this occurs when using a too poor initial state. In this work, we introduce a new formula for implementing QSP transformations of Hermitian matrices, which requires neither auxiliary qubits nor post-selection. Rather, using approximation to the exact unitary synthesis, we leverage the theory of the double-bracket quantum algorithms to provide a new quantum algorithm for QSP, termed Double-Bracket QSP (DB-QSP). The algorithm requires the energy and energetic variance of the state to be measured at each step and has a recursive structure, which leads to circuit depths that can grow super exponentially with the degree of the polynomial. With these strengths and caveats in mind, DB-QSP should be viewed as complementing the established QSP toolkit. In particular, DB-QSP can deterministically implement low-degree polynomials to ``warm start" QSP methods involving post-selection.

arXiv:2504.01077•Quantum•Dec 23, 2025•16 citations

Probabilistic nonunitary quantum computing

Colin P. Williams

In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state. In this paper we use this theory to construct quantum circuits that perform desired non-unitary state transformations of the sort arising in lattice-based quantum search. Such n-qubit non-unitary gates cannot be achieved deterministically, but they can be achieved probabilistically using a single ancilla. Our approach is to use the n-qubit non-unitary gate to design an (n+1)-qubit Hamiltonian that can be seen to induce a suitable conditional dynamics such that whenever the output value of the ancilla qubit is measured and found to be |O>, then the remaining (unmeasured) n qubits will contain the desired non-unitary transform of the n-qubit input state. The scheme is necessarily probabilistic because we cannot force the measurement on the ancilla qubit to return the value we want. Fortunately, however, failed attempts are found to disturb the n-qubit input state very little. This allows us to re-use the result of successive “failed” attempts until the success condition is finally attained, and we give analytic expressions for the success probability and net fidelity in this case. By using our previous method for designing a quantum circuit for an arbitrary n-qubit gate in conjunction with our new probabilistic non-unitary procedure we are able to compute an explicit quantum circuit sufficient to implement an arbitrary linear, yet non-unitary, transformation of an input pure or mixed n-qubit state, using only a single copy of the input state. This allows us to extend the repertoire of computations that may be performed on a quantum computer, and in particular, gives the first explicit construction of the quantum circuits needed to perform some of the key operations arising in quantum lattice search.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•9 citations

Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization

Vincent Graves, Manqoba Q. Hlatshwayo, Theodoros Kapourniotis +1 more

Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly $\lceil \log_2 (N) \rceil$ where $N$ is the size of the CIM. In addition, we introduce a novel single-bit flip error mitigation which comes at the overhead of a single qubit and we combine this with a stochastic approximate Trotterization evolution adapted from qDRIFT. Simulating benchmark N$_2$ and naphthalene molecules on quantum hardware, our results achieved similar accuracy as SQD methods but with significantly less quantum resources. However, our CIM-QSCI algorithm and SQD methods could not match the performance of classical heat-bath CI (HCI) for the same task. Hence, we introduce an augmented version of QSCI called quantum selected heat-bath CI (QSHCI). This variant replaces classical heat-bath sampling with quantum sampling from QSCI to achieve performance comparable to HCI. We note that a current drawback of our approach is the preprocessing cost of $\mathcal{O}(N^2\log N)$ for constructing the CIM and performing the Pauli decomposition. This can be further improved by considering efficient CIM access models for the stochastic Trotter evolution.

quant-pharXiv:2603.13160•Journal of Chemical Theory and Computation•Mar 16, 2026•2 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ϵ/log(1\ensuremath−p)]O[log\ensuremath{\epsilon}/log(1\ensuremath{-}p)]O[log\ensuremathϵ/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.
Abstract Variational quantum algorithms, as one of the most promising routes in the noisy intermediate-scale quantum era, offer various potential applications while also confronting severe challenges due to near-term quantum hardware restrictions. In this work, we propose a framework to enhance the expressiveness of a variational quantum ansatz by incorporating variational post-selection techniques. These techniques apply variational modules and neural network post-processing on ancilla qubits, which are compatible with the current generation of quantum devices. Equipped with variational post-selection, we demonstrate that the accuracy of the variational ground state and thermal state preparation for both quantum spin and molecule systems is substantially improved. Notably, in the case of estimating the local properties of a thermalized quantum system, we present a scalable approach that outperforms previous methods through the combination of neural post-selection and a new optimization objective.
Measurement-induced phase transitions (MIPT) offer a novel paradigm for exploring quantum criticality, yet their experimental observation remains stifled by the "post-selection problem"—the exponential cost of resolving quantum trajectories. Here, we propose a scalable protocol to observe feedback-stabilized criticality on current Noisy Intermediate-Scale Quantum (NISQ) processors, eliminating the need for post-selection. By coupling local measurements to real-time unitary feedback, we demonstrate that a many-body quantum system can be steered toward the universal 1/e information horizon, effectively turning the measurement back-action from a source of decoherence into a resource for complexity. Extensive numerical simulations incorporating realistic depolarizing noise reveal a robust stability plateau extending to gate error rates of p ≈ 10⁻², compatible with state-of-the-art superconducting architectures such as IBM Heron. Furthermore, we introduce a verification scheme based on classical shadows to efficiently estimate the Schmidt concentration ⟨K_c⟩ without full tomography. Our results establish that thermodynamic error correction is achievable in the NISQ era, providing a blueprint for the first experimental observation of a feedback-induced phase transition at the mesoscopic scale (N ~ 100).
Quantum communication and computation harness the intriguing and bewildering nature of quantum mechanics to realize information processing tasks that have no classical analog. Nonetheless, this supremacy comes with fundamental limits that, in some scenarios, pose undesirable bounds on the performance of these quantum technologies. One such example is the well-known quantum no-cloning theorem imposed by the Heisenberg uncertainty principle. It states that an unknown quantum state cannot be duplicated with arbitrarily high accuracy. Very recently, however, post-selection was proposed as a way out: it was demonstrated that in various quantum information tasks, deterministic bounds can be overcome by forgoing determinism. In this thesis, we investigate post-selection as a novel approach to enhance the performance of versatile continuous-variable (CV) quantum information processing and envisage it to become a useful component of the general Gaussian toolbox. The first part of this thesis examines applications of post-selection in purely linear systems. In particular, two implementations of the noiseless linear amplifier (NLA), the measurement-based NLA and the physical NLA, are investigated and compared in terms to their abilities to preserve the state Gaussianity and their success probability. We show that the inevitable signal-to-noise ratio (SNR) degradation accompanying a linear quantum amplifier can be circumvented by resorting to a probabilistic scheme. Amplification with a signal transfer coefficient of Ts>1 is realised by combining a measurement-based NLA with a deterministic linear amplifier. We also construct a quantum cloning machine based on this hybrid amplifier for arbitrary coherent input states. We demonstrate a production of multiple clones (up to five) with fidelity of each clone exceeding the corresponding no-cloning limit. We then consider employing the post-selection algorithm in information protocols involving nonlinearity. First, we develop two squeezers as optical parametric amplifiers, each producing fairly pure squeezed output field up to 11.2dB (after correcting the detection loss). The squeezers are served as the nonlinear source in the remaining part of this thesis. We demonstrate a high fidelity quantum squeezing gate which is one indispensible building block for constructing a universal CV quantum computer. An inverse-Gaussian filter is incorporated into the feedforward line, leading to an enhancement in precision of the inline dual-homodyne measurement and therefore combats efficiently the correlation degradation due to loss and noise introduced during feedforward. As one example, we show that a fidelity of 98.49% for a target squeezing of -2.3dB is obtained with only -6dB ancilla squeezing, which would otherwise require -20.5dB initial squeezing using a conventional deterministic setup. Additionally, we introduce a CV quantum teleportation scheme using post-selection, allowing for a significantly improved fidelity against the conventional deterministic CV teleporter. The intuition behind this improvement is that post-selection effectively distilled the accessible entanglement and therefore a high fidelity only originally achievable with a higher amount of initial squeezing is now obtainable with only modest amount of squeezing, coming at an expense of finite success probability.
Quantum Signal Processing (QSP), a framework for implementing matrix-valued polynomials, is a fundamental primitive in various quantum algorithms. Despite its versatility, a potentially underappreciated challenge is that all systematic protocols for implementing QSP rely on post-selection. This can impose prohibitive costs for tasks when amplitude amplification cannot sufficiently improve the success probability. For example, in the context of ground-state preparation, this occurs when using a too poor initial state. In this work, we introduce a new formula for implementing QSP transformations of Hermitian matrices, which requires neither auxiliary qubits nor post-selection. Rather, using approximation to the exact unitary synthesis, we leverage the theory of the double-bracket quantum algorithms to provide a new quantum algorithm for QSP, termed Double-Bracket QSP (DB-QSP). The algorithm requires the energy and energetic variance of the state to be measured at each step and has a recursive structure, which leads to circuit depths that can grow super exponentially with the degree of the polynomial. With these strengths and caveats in mind, DB-QSP should be viewed as complementing the established QSP toolkit. In particular, DB-QSP can deterministically implement low-degree polynomials to ``warm start" QSP methods involving post-selection.
In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state. In this paper we use this theory to construct quantum circuits that perform desired non-unitary state transformations of the sort arising in lattice-based quantum search. Such n-qubit non-unitary gates cannot be achieved deterministically, but they can be achieved probabilistically using a single ancilla. Our approach is to use the n-qubit non-unitary gate to design an (n+1)-qubit Hamiltonian that can be seen to induce a suitable conditional dynamics such that whenever the output value of the ancilla qubit is measured and found to be |O>, then the remaining (unmeasured) n qubits will contain the desired non-unitary transform of the n-qubit input state. The scheme is necessarily probabilistic because we cannot force the measurement on the ancilla qubit to return the value we want. Fortunately, however, failed attempts are found to disturb the n-qubit input state very little. This allows us to re-use the result of successive “failed” attempts until the success condition is finally attained, and we give analytic expressions for the success probability and net fidelity in this case. By using our previous method for designing a quantum circuit for an arbitrary n-qubit gate in conjunction with our new probabilistic non-unitary procedure we are able to compute an explicit quantum circuit sufficient to implement an arbitrary linear, yet non-unitary, transformation of an input pure or mixed n-qubit state, using only a single copy of the input state. This allows us to extend the repertoire of computations that may be performed on a quantum computer, and in particular, gives the first explicit construction of the quantum circuits needed to perform some of the key operations arising in quantum lattice search.
Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration interaction (QSCI) and sample-based quantum diagonalization (SQD), have been formulated within second-quantization in Fock space, which leads to inefficient usage of qubit resources. We introduce the first QSCI algorithm developed in the CI-matrix (CIM) framework, which is known to have optimal qubit scaling of exactly ⌈log⁡2(N)⌉\lceil \log_2 (N) \rceil⌈log2​(N)⌉ where NNN is the size of the CIM. In addition, we introduce a novel single-bit flip error mitigation which comes at the overhead of a single qubit and we combine this with a stochastic approximate Trotterization evolution adapted from qDRIFT. Simulating benchmark N2_22​ and naphthalene molecules on quantum hardware, our results achieved similar accuracy as SQD methods but with significantly less quantum resources. However, our CIM-QSCI algorithm and SQD methods could not match the performance of classical heat-bath CI (HCI) for the same task. Hence, we introduce an augmented version of QSCI called quantum selected heat-bath CI (QSHCI). This variant replaces classical heat-bath sampling with quantum sampling from QSCI to achieve performance comparable to HCI. We note that a current drawback of our approach is the preprocessing cost of O(N2log⁡N)\mathcal{O}(N^2\log N)O(N2logN) for constructing the CIM and performing the Pauli decomposition. This can be further improved by considering efficient CIM access models for the stochastic Trotter evolution.