Estimating expectation values using approximate quantum states
Rigetti Computing（里盖蒂计算公司）；Information Sciences Institute, University of Southern California（南加州大学信息科学研究所）
Marco Paini, Amir Kalev, Dan Padilha, Brendan Ruck
备注：
8+5 pages; supersedes the general approximate state description section of arXiv:1910.10543 with improved presentation, new experiments and a discussion on related work; Version 2: minor edits; Version 3: Quantum journal version
We introduce an approximate description of an $N$-qubit state, which contains sufficient information to estimate the expectation value of any observable to a precision that is upper bounded by the ratio of a suitably-defined seminorm of the observable to the square root of the number of the system's identical preparations $M$, with no explicit dependence on $N$. We describe an operational procedure for constructing the approximate description of the state that requires, besides the quantum state preparation, only single-qubit rotations followed by single-qubit measurements. We show that following this procedure, the cardinality of the resulting description of the state grows as $3MN$. We test the proposed method on Rigetti's quantum processor unit with 12, 16 and 25 qubits for random states and random observables, and find an excellent agreement with the theory, despite experimental errors.
We examine the problem of estimating the expectation values of two observables when we have a finite number of copies of an unknown qubit state. Specifically we examine whether it is better to measure each of the observables separately on different copies or to perform a joint measurement of the observables on each copy. We find that joint measurements can sometimes provide an advantage over separate measurements, but only if we make estimates of an observable based solely on the results of measurements of that observable. If we instead use both sets of results to estimate each observable then…
Many quantum algorithms involve the evaluation of expectation values. Optimal strategies for estimating a single expectation value are known, requiring a number of state preparations that scales with the target error $\varepsilon$ as $\mathcal{O}(1/\varepsilon)$. In this paper, we address the task of estimating the expectation values of $M$ different observables, each to within additive error $\varepsilon$, with the same $1/\varepsilon$ dependence. We describe an approach that leverages Gilyén et al.'s quantum gradient estimation algorithm to achieve $\mathcal{O}(\sqrt{M}/\varepsilon)$ scaling…
The System of Linear Equations Problem (SLEP) is specified by a complex invertible matrix $A$, the condition number $κ$ of $A$, a vector $b$, a Hermitian matrix $M$ and an accuracy $ε$, and the task is to estimate $x^\dagger Mx$, where $x$ is the solution vector to the equation $Ax = b$. We aim to establish a lower bound on the complexity of the end-to-end quantum algorithms for SLEP with respect to $ε$, and devise a quantum algorithm that saturates this bound. To make lower bounds attainable, we consider query complexity in the setting in which a block encoding of $M$ is given, i.e., a unitar…
Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state |psi> of the quantum system. Such expectation values can be measured by repeatedly preparing |psi> and coupling the system to an apparatus. For this method, the precision of the measured value scales as 1/sqrt(N) for N repetitions of the experiment. For the problem of estimating the parameter phi in an evolution exp(-i phi H), it is possible to achieve precision 1/N (the quantum metrology limit) provided that sufficient information about H and its spectrum is a…
We report on the energy-expectation-value landscapes produced by the single-layer ($p=1$) Quantum Approximate Optimization Algorithm (QAOA) when being used to solve Ising problems. The landscapes are obtained using an analytical formula that we derive. The formula allows us to predict the landscape for any given Ising problem instance and consequently predict the optimal QAOA parameters for heuristically solving that instance using the single-layer QAOA. We have validated our analytical formula by showing that it accurately reproduces the landscapes published in recent experimental reports. We…
We introduce an approximate description of an $N$-qubit state, which contains sufficient information to estimate the expectation value of any observable with precision independent of $N$. We show, in fact, that the error in the estimation of the observables' expectation values decreases as the inverse of the square root of the number of the system's identical preparations and increases, at most, linearly in a suitably defined, $N$-independent, seminorm of the observables. Building the approximate description of the $N$-qubit state only requires repetitions of single-qubit rotations followed by…
In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call approximate tensorization of the relative entropy, can be expressed as a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive co…
In quantum chaos, the spectral statistics generally follows the predictions of Random Matrix Theory (RMT). A notable exception is given by scar states, that enhance probability density around unstable periodic orbits of the classical system, therefore causing significant deviations of the spectral density from RMT expectations. In this work, the problem is considered of both RMT-ruled and scarred chaotic systems coupled to an opening. In particular, predictions are derived for the spectral density of a chaotic Hamiltonian scattering into a single- or multiple channels. The results are tested o…
We address the problem of estimating the expectation value <O> of an arbitrary operator O via a universal measuring apparatus that is independent of O, and for which the expectation values for different operators are obtained by changing only the data-processing. The ``universal detector'' performs a joint measurement on the system and on a suitably prepared ancilla. We characterize such universal detectors, and show how they can be obtained either via Bell measurements or via local measurements and classical communication between system and ancilla.
It is known that mutually unbiased bases, whenever they exist, are optimal in an information theoretic sense for the determination of unknown state of a quantum ensemble. These bases may not exist in most dimensions and some suboptimal choices have to be made. The present paper deals with estimates of the information loss in suboptimal choice of bases. The information is calculated directly in terms of transition probabilities. I give estimates for the information content of measurement in some approximate MUBs proposed recently.
We demonstrate the implementation of a quantum algorithm for estimating the number of matching items in a search operation using a two qubit nuclear magnetic resonance (NMR) quantum computer.
We investigate the cost of Grover's quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions. Our cost model assumes that the attack is run on a surface code based fault-tolerant quantum computer. Our estimates rely on a time-area metric that costs the number of logical qubits times the depth of the circuit in units of surface code cycles. As a surface code cycle involves a significant classical processing stage, our cost estimates allow for crude, but direct, comparisons of classical and quantum algorithms. We exhibit a circuit f…
Given n qubits prepared according to the same unknown density operator, we propose a nondestructive measuring method which approximately yields the eigenstates. It is shown that, for any plane which passes through the center point of the Bloch sphere, there exists corresponding projective measurement. By performing these measurements, we can scan the whole Bloch sphere like radar to search for the orientation of and determine the eigenstates. We show the convergency of the measurements. This result actually reveals a mathematical structure of the n-fold Hilbert space .
We show how to find families of infima and suprema for the entanglement negativity using only a few, low-order moments of the partially transposed density matrix $ρ^{T_2}.$ These moments can be measured using the multi-copy quantum circuits previously given by the author, which define a set of multi-copy expectation values and thus can be used with the replica trick. As such, these bounds are suitable for use with Quantum Monte Carlo methods, and the lower order versions of the estimates may be experimentally accessible for some systems. Using more moments for higher-order versions of these me…
