arrow
Return

Random projection using random quantum circuits

delete2024-01-03
delete1
delete
OA
AI
K
Keerthi Kumaran
M
Manas Sajjan
S
Sangchul Oh
S
Sabre Kais *
DOI:10.1103/PhysRevResearch.6.013010delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The random sampling task performed by Google's Sycamore processor gave us a glimpse of the quantum supremacy era. This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, 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 [similar to 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 datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets 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 data sets in reduced dimensions.
Keywords:
JOHNSON-LINDENSTRAUSS
REPRESENTATION

Journal

Physical Review Research cover
Physical Review Research
IF:
4.2
Papers:
7.6K
Citations:
2.7W

Organization

Purdue University System cover
Purdue University System
Scholars:
4.0W
Papers: 3.6W
Citations: 66
P
Purdue University
Scholars:
2.7W
Papers: 2.1W
Citations: 147
Cited Papers

Cited Papers

Barren plateaus in quantum neural network training landscapes
err2018-11-16
err1.1K
errOAAI
errMcClean, Jarrod R.; Boixo, Sergio; Smelyanskiy, Vadim N.; Babbush, Ryan; Neven, Hartmut
errShare
errSave
Applying a random projection algorithm to optimize machine learning model for predicting peritoneal metastasis in gastric cancer patients using CT images
err2021-03-01
err38
errOAAI
errMirniaharikandehei, Seyedehnafiseh; Heidari, Morteza; Danala, Gopichandh; Lakshmivarahan, Sivaramakrishnan; Zheng, Bin
errShare
errSave
Quantum autoencoders for efficient compression of quantum data
err2017-08-18
err356
errOAAI
errRomero, Jonathan; Olson, Jonathan P.; Aspuru-Guzik, Alan
errShare
errSave
errShare
errSave
On the Structure of Ge/GeO2 Glasses
err2001-06-18
err0
PREAI
errIan R. Beattie; Peter J. Jones; Stephen Roberts
errShare
errSave
Quantum Generative Adversarial Networks for learning and loading random distributions
err2019-11-22
err288
errOAAI
errZoufal, Christa; Lucchi, Aurelien; Woerner, Stefan
errShare
errSave
Challenges and perspectives for species distribution modelling in the neotropics
err2011-10-26
err0
errOAAI
errLuciana H. Y. Kamino; João Renato Stehmann; Silvana Amaral; Paulo De Marco; Thiago F. Rangel; Marinez F. de Siqueira; Renato De Giovanni; Joaquín Hortal
errShare
errSave
Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicators
err2022-05-20
err51
errOAAI
errNakaji, Kouhei; Uno, Shumpei; Suzuki, Yohichi; Raymond, Rudy; Onodera, Tamiya; Tanaka, Tomoki; Tezuka, Hiroyuki; Mitsuda, Naoki; Yamamoto, Naoki
errShare
errSave
researcher View more