Abstract We consider the problem of efficiently implementing a generalized measurement on a quantum computer. Using methods from representation theory, we exploit symmetries of the states we want to identify respectively symmetries of the measurement operators. In order to allow the information to be extracted sequentially, the disturbance of the quantum state due to the measurement should be minimal.
Abstract We consider the problem of efficiently implementing a generalized measurement on a quantum computer. Using methods from representation theory, we exploit symmetries of the states we want to identify respectively symmetries of the measurement operators. In order to allow the information to be extracted sequentially, the disturbance of the quantum state due to the measurement should be minimal.
This chapter contains sections titled: Introduction Minimal-disturbing Implementations of POVMs Generalized Measurements of Quantum Systems Positive-operator Valued Measures Orthogonal Measurements Disturbance of a Generalized Measurement Minimal-disturbing Implementation of a POVM Symmetric Matrices and their Structure Representations of Finite Groups Projective Representations Symmetry of a Matrix and Schur's Lemma Symmetric POVMs Define Matrices with Symmetry Implementation of Symmetric POVMs Cyclic and Heisenberg-Weyl Groups Cyclic Groups Heisenberg-Weyl Groups Conclusions and Outlook References
The extraction of information from a quantum system unavoidably implies a modification of the measured system itself. In this framework partial measurements can be carried out in order to extract only a portion of the information encoded in a quantum system, at the cost of inducing a limited amount of disturbance. Here we analyze experimentally the dynamics of sequential partial measurements carried out on a quantum system, focusing on the trade-off between the maximal information extractable and the disturbance. In particular we implement two sequential measurements observing that, by exploiting an adaptive strategy, is possible to find an optimal trade-off between the two quantities.
Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state $\ensuremath{\mid}\ensuremath{\psi}⟩$ of the quantum system. Such expectation values can be measured by repeatedly preparing $\ensuremath{\mid}\ensuremath{\psi}⟩$ and coupling the system to an apparatus. For this method, the precision of the measured value scales as N1 for N repetitions of the experiment. For the problem of estimating the parameter $\ensuremath{\phi}$ in an evolution ${e}^{\ensuremath{-}i\ensuremath{\phi}H}$, it is possible to achieve precision N1 [the quantum metrology limit; see Giovannetti et al., Phys. Rev. Lett. 96, 010401 (2006)] provided that sufficient information about H and its spectrum is available. We consider the more general problem of estimating expectations of operators A with minimal prior knowledge of A. We give explicit algorithms that approach precision N1 given a bound on the eigenvalues of A or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of $\ensuremath{\mid}\ensuremath{\psi}⟩$ and $U\ensuremath{\mid}\ensuremath{\psi}⟩$, where U is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.
The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When these observables do not commute, we may obtain information about joint properties of a quantum system that would be forbidden in the usual strong measurement scenario. As an application, we provide a physically compelling characterization of the notion of counterfactual quantum computation.
In a previous paper we have presented a general scheme for the implementation of symmetric generalized measurements (POVMs) on a quantum computer. This scheme is based on representation theory of groups and methods to decompose matrices that intertwine two representations. We extend this scheme in such a way that the measurement is minimally disturbing, i.e., it changes the state vector ∣Ψ⟩ of the system to Π∣Ψ⟩ where Π is the positive operator corresponding to the measured result. Using this method, we construct quantum circuits for measurements with Heisenberg–Weyl symmetry. A continuous generalization leads to a scheme for optimal simultaneous measurements of position and momentum of a Schrödinger particle moving in one dimension such that the outcomes satisfy ΔxΔp⩾ℏ. The particle to be measured collides with two probe particles, one for the position and the other for the momentum measurement. The position and momentum resolution can be tuned by the entangled joint state of the probe particles which is also generated by a collision with hard-core potential. The parameters of the POVM can then be controlled by the initial widths of the wave functions of the probe particles. We point out some formal similarities and differences to simultaneous measurements of quadrature amplitudes in quantum optics.
Quantum measurements play a fundamental role in quantum mechanics and quantum information processing, but it is not easy to implement generalized measurements, the most powerful measurements allowed by quantum mechanics. Here, we propose a simple recipe for implementing generalized measurements on a qudit via quantum walks. With this recipe, any discrete quantum measurement can be implemented via a one-dimensional discrete quantum walk; the number of steps is only two times the number of measurement outcomes. As an illustration, we present a unified solution for implementing arbitrary symmetric informationally complete measurements in dimension 3.