Compressed Sensing Tomography for qudits in Hilbert spaces of non-power-of-two dimensions

• URL: http://arxiv.org/abs/2006.01803v2
• Date: Mon, 6 Jul 2020 12:55:28 GMT
• Title: Compressed Sensing Tomography for qudits in Hilbert spaces of non-power-of-two dimensions
• Authors: Revanth Badveli, Vinayak Jagadish, R. Srikanth, Francesco Petruccione
• Abstract summary: The techniques of low-rank matrix recovery were adapted for Quantum State Tomography (QST) We propose an alternative strategy, in which the quantum information is swapped into the subspace of a power-two system using only $textrmpoly(log(d)2)$ gates at most.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The techniques of low-rank matrix recovery were adapted for Quantum State Tomography (QST) previously by D. Gross et al. [Phys. Rev. Lett. 105, 150401 (2010)], where they consider the tomography of $n$ spin-$1/2$ systems. For the density matrix of dimension $d = 2^n$ and rank $r$ with $r \ll 2^n$, it was shown that randomly chosen Pauli measurements of the order $O(dr \log(d)^2)$ are enough to fully reconstruct the density matrix by running a specific convex optimization algorithm. The result utilized the low operator-norm of the Pauli operator basis, which makes it `incoherent' to low-rank matrices. For quantum systems of dimension $d$ not a power of two, Pauli measurements are not available, and one may consider using SU($d$) measurements. Here, we point out that the SU($d$) operators, owing to their high operator norm, do not provide a significant savings in the number of measurement settings required for successful recovery of all rank-$r$ states. We propose an alternative strategy, in which the quantum information is swapped into the subspace of a power-two system using only $\textrm{poly}(\log(d)^2)$ gates at most, with QST being implemented subsequently by performing $O(dr \log(d)^2)$ Pauli measurements. We show that, despite the increased dimensionality, this method is more efficient than the one using SU($d$) measurements.

Related papers

• Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms [50.15964512954274]
  We study the problem of residual error estimation for matrix and vector norms using a linear sketch. We demonstrate that this gives a substantial advantage empirically, for roughly the same sketch size and accuracy as in previous work. We also show an $Omega(k2/pn1-2/p)$ lower bound for the sparse recovery problem, which is tight up to a $mathrmpoly(log n)$ factor.
  arXiv  Detail & Related papers  (2024-08-16T02:33:07Z)
• The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer [0.042855555838080824]
  We perform a detailed estimate for the prospect of using deep entanglement renormalization ansatz on a fault-tolerant quantum computer. For probing a relatively large system size, we observe up to an order of magnitude reduction in the number of qubits. For estimating the energy per site of $epsilon$, $mathcalOleft(fraclog Nepsilon right)$ $T$ gates and $mathcalOleft(log Nright)$ qubits suffice.
  arXiv  Detail & Related papers  (2024-04-15T18:00:17Z)
• Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems [61.85150061213987]
  We study the generalized low-rank matrix bandit problem, proposed in citelu2021low under the Generalized Linear Model (GLM) framework. To overcome the computational infeasibility and theoretical restrain of existing algorithms, we first propose the G-ESTT framework. We show that G-ESTT can achieve the $tildeO(sqrt(d_1+d_2)3/2Mr3/2T)$ bound of regret while G-ESTS can achineve the $tildeO
  arXiv  Detail & Related papers  (2024-01-14T14:14:19Z)
• Learning Distributions over Quantum Measurement Outcomes [4.467248776406005]
  Shadow tomography for quantum states provides a sample efficient approach for predicting the properties of quantum systems. We develop an online shadow tomography procedure that solves this problem with high success probability.
  arXiv  Detail & Related papers  (2022-09-07T09:08:58Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs [111.75736569611159]
  We propose the first computationally efficient horizon-free algorithm for linear mixture MDPs. Our algorithm adapts a weighted least square estimator for the unknown transitional dynamic. This also improves upon the best-known algorithms in this setting when $sigma_k2$'s are known.
  arXiv  Detail & Related papers  (2022-05-23T17:59:18Z)
• How to simulate quantum measurement without computing marginals [3.222802562733787]
  We describe and analyze algorithms for classically computation measurement of an $n$-qubit quantum state $psi$ in the standard basis. Our algorithms reduce the sampling task to computing poly(n)$ amplitudes of $n$-qubit states.
  arXiv  Detail & Related papers  (2021-12-15T21:44:05Z)
• Improved quantum lower and upper bounds for matrix scaling [0.0]
  We investigate the possibilities for quantum speedups for classical second-order algorithms. We show that there can be essentially no quantum speedup in terms of the input size in the high-precision regime. We give improved quantum algorithms in the low-precision regime.
  arXiv  Detail & Related papers  (2021-09-30T17:29:23Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)
• Sample efficient tomography via Pauli Measurements [11.98034899127065]
  We explore the power of Pauli measurements in the state tomography related problems. We show that the textitquantum state tomography problem of $n$-qubit system can be accomplished with $mathcalO(frac10nepsilon2)$ copies of the unknown state using Pauli measurements.
  arXiv  Detail & Related papers  (2020-09-10T00:04:44Z)
• Naive Exploration is Optimal for Online LQR [49.681825576239355]
  We show that the optimal regret scales as $widetildeTheta(sqrtd_mathbfu2 d_mathbfx T)$, where $T$ is the number of time steps, $d_mathbfu$ is the dimension of the input space, and $d_mathbfx$ is the dimension of the system state. Our lower bounds rule out the possibility of a $mathrmpoly(logT)$-regret algorithm, which had been
  arXiv  Detail & Related papers  (2020-01-27T03:44:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.