Random Projection using Random Quantum Circuits

• URL: http://arxiv.org/abs/2308.13919v4
• Date: Sun, 21 Jan 2024 02:19:48 GMT
• Title: Random Projection using Random Quantum Circuits
• Authors: Keerthi Kumaran, Manas Sajjan, Sangchul Oh, Sabre Kais
• Abstract summary: We explore a near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths serve as good candidates for random projection. We also benchmark the performance of quantum random projection against the commonly used classical random projection.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The random sampling task performed by Google's Sycamore processor gave us a glimpse of the "Quantum Supremacy era". This has definitely shed some spotlight on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo-) random circuits. In this manuscript, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths ($\sim O(n)$) serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image data sets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image datasets and computing Von Neumann entropies of large low-rank density matrices. And finally using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large datasets in reduced dimensions.

Related papers

• On verifiable quantum advantage with peaked circuit sampling [9.551919087634522]
  We show that getting $1/textpoly(n)$ peakedness from such circuits requires $tau_p = Omega(tau_r/n)0.19)$ with overwhelming probability. We also give numerical evidence that nontrivial peakedness is possible in this model.
  arXiv  Detail & Related papers  (2024-04-22T18:00:06Z)
• Generalized Time-bin Quantum Random Number Generator with Uncharacterized Devices [0.0]
  This work analyzes evolutions in the extractable amount of randomness with increasing the Hilbert space dimension. We investigate the generic case of time-bin encoding scheme, define various input (state preparation) and outcome (measurement) subspaces. We demonstrate that this approach can boost the system entropy, resulting in more extractable randomness.
  arXiv  Detail & Related papers  (2023-05-05T15:53:22Z)
• Simulating lossy Gaussian boson sampling with matrix product operators [7.33258560389563]
  We show that efficient tensor network simulations are likely possible under the $N_textoutproptosqrtN$ scaling of the number of surviving photons. We overcome previous challenges due to the large local space dimensions in Gaussian boson sampling with hardware acceleration.
  arXiv  Detail & Related papers  (2023-01-30T12:10:39Z)
• Improved Real-time Post-Processing for Quantum Random Number Generators [10.453509966841022]
  We propose two novel quantum-proof randomness extractors for reverse block sources that realize real-time block-wise extraction. Our designs achieve a significantly higher extraction speed and a longer output data length with the same seed length. Applying our extractors to the raw data generated by a widely used quantum random number generator, we achieve a simulated extraction speed as high as $300$ Gbps.
  arXiv  Detail & Related papers  (2023-01-20T15:02:37Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Holographically-controlled random numbers from entangled twisted photons [0.0]
  We present a quantum random number generator (QRNG) based on the random outcomes inherent in projective measurements on a superposition of quantum states of light. We use multiplexed holograms encoded on a spatial light modulator to spatially map down-converted photons onto a superposition of optical paths. Our QRNG achieved a min-entropy of $textH_textmin=0.9991pm0.0003$ bits per photon and passed the NIST statistical test suite.
  arXiv  Detail & Related papers  (2020-07-15T12:34:44Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.