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.
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.
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 singular value transformation (QSVT) is a powerful framework that unifies many quantum algorithms, including Grover’s search, by enabling polynomial transformations of the singular values of linear operators embedded in unitary matrices. We present an improved quantum search algorithm within this framework. Instead of amplifying the target state amplitude, our method suppresses the non-target amplitude using a modified Chebyshev polynomial. This approach achieves the optimal O(Nlog(1/δ)) query complexity while requiring lower-degree polynomials. For N = 512, our method reduces the polynomial degree from 71 to 43 compared to prior QSVT-based fixed-point search. We also demonstrate how QSVT enables exact search construction.
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.
Given the ability to apply an unknown quantum channel acting on a d-dimensional system, we develop a quantum algorithm for transforming its singular values. The spectrum of a quantum channel as a superoperator is naturally tied to its Liouville representation, which is in general non-Hermitian. Our key contribution is an approximate block-encoding scheme for this representation in a Hermitized form, given only black-box access to the channel; this immediately allows us to apply polynomial transformations to the channel's singular values by quantum singular value transformation (QSVT). We then demonstrate an O(d3/δ) upper bound and an Ω(d/δ) lower bound for the query complexity of constructing a quantum channel that is δ-close in diamond norm to a block-encoding of the unnormalized Hermitized Liouville representation. We show our method applies practically to the problem of learning the q-th singular value moments of unknown quantum channels for arbitrary q>2,q∈R, which has implications for testing if a quantum channel is entanglement breaking. Our results establish a general framework for manipulating black-box quantum channels with QSVT and related methods, enabling direct evaluation of the channel's spectral properties without tomography or significant classical post-processing.
Reliably transmitting quantum information via a noisy quantum channel is a central challenge in quantum information science. While constructing a decoder is crucial to this goal, little was known about quantum circuit implementations of decoders that reach high communication rates. In this paper, we provide two decoders with explicit quantum circuits capable of recovering quantum information when the decoupling condition is satisfied, i.e., when quantum information is in principle recoverable. These are applicable to both entanglement-assisted and non-assisted settings. By developing a technique that relies on a symmetric structure of the decoders, we show that they are applicable to any noise model. As a consequence, for any noisy channel, our decoders can be used to achieve a communication rate arbitrarily close to the quantum capacity by increasing the number of channel uses. To construct the decoders, we employ the fixed-point amplitude amplification (FPAA) based on the quantum singular value transformation (QSVT), extending a previous approach applicable only to erasure noise. Our constructions offer advantages in the computational cost, largely reducing the circuit complexity compared to previous explicit decoders. Through an investigation of the decoding problem, unique advantages of the QSVT-based FPAA are highlighted.
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for new ones. Existing implementations of QSVT rely on block encoding, incurring an intrinsic O(logL) ancilla overhead and circuit depth O(Ldλ) for polynomial transformations of a Hamiltonian H=∑k=1LHk, where d is the polynomial degree and λ=∑k∥Hk∥. We introduce a simple yet powerful approach that utilizes only basic Hamiltonian simulation techniques, namely, Trotter methods, to: (i) eliminate the need for block encoding, (ii) reduce the ancilla overhead to only a single qubit, and (iii) still maintain near-optimal complexity. Our method achieves a circuit depth of O(L(dλcomm)1+o(1)), without requiring any complicated multi-qubit controlled gates. Moreover, λcomm depends on the nested commutators of the terms of H and can be substantially smaller than λ for many physically relevant Hamiltonians, a feature absent in standard QSVT. To achieve these results, we make use of Richardson extrapolation in a novel way, systematically eliminating errors in any interleaved sequence of arbitrary unitaries and Hamiltonian evolution operators, thereby establishing a general framework that encompasses QSVT but is more broadly applicable. As applications, we develop end-to-end quantum algorithms for solving linear systems and estimating ground state properties of Hamiltonians, both achieving near-optimal complexity without relying on oracular access. Overall, our results establish a new framework for quantum algorithms, significantly reducing hardware overhead while maintaining near-optimal performance, with implications for both near-term and fault-tolerant quantum computing.