English
Related papers

Related papers: How hard is it to verify a classical shadow?

200 papers

Quantum machine learning is often highlighted as one of the most promising practical applications for which quantum computers could provide a computational advantage. However, a major obstacle to the widespread use of quantum machine…

Quantum Physics · Physics 2024-07-09 Sofiene Jerbi , Casper Gyurik , Simon C. Marshall , Riccardo Molteni , Vedran Dunjko

We propose to analyse quantum protocols by applying formal verification techniques developed in classical computing for the analysis of communicating concurrent systems. One area of successful application of these techniques is that of…

Quantum Physics · Physics 2007-05-23 Rajagopal Nagarajan , Simon Gay

Although the security of quantum cryptography is provable based on the principles of quantum mechanics, it can be compromised by the flaws in the design of quantum protocols and the noise in their physical implementations. So, it is…

Quantum Physics · Physics 2013-11-15 Yuan Feng , Nengkun Yu , Mingsheng Ying

Recently, there are more and more organizations offering quantum-cloud services, where any client can access a quantum computer remotely through the internet. In the near future, these cloud servers may claim to offer quantum computing…

Quantum Physics · Physics 2021-05-20 Xi Chen , Bin Cheng , Zhaokai Li , Xinfang Nie , Nengkun Yu , Man-Hong Yung , Xinhua Peng

Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical…

Quantum Physics · Physics 2015-07-08 Sean Hallgren , Adam Smith , Fang Song

The classical shadows protocol, introduced by Huang et al. [Nat. Phys. 16, 1050 (2020)], makes use of the median-of-means (MoM) estimator to efficiently estimate the expectation values of $M$ observables with failure probability $\delta$…

Quantum Physics · Physics 2025-06-25 Winston Fu , Dax Enshan Koh , Siong Thye Goh , Jian Feng Kong

We define the notion of a proof of knowledge in the setting where the verifier is classical, but the prover is quantum, and where the witness that the prover holds is in general a quantum state. We establish simple properties of our…

Quantum Physics · Physics 2021-01-20 Thomas Vidick , Tina Zhang

Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms, offering a hybrid quantum-classical framework that, under certain aspects, can be considered similar to classical deep neural networks.…

Quantum Physics · Physics 2025-07-16 Nicola Assolini , Luca Marzari , Isabella Mastroeni , Alessandra di Pierro

Quantum inspired protocols e.g. [AAV13,AG17] attempt to achieve a single-prover interactive protocol where a classical machine can verify quantum computations in an information-theoretically secure manner. We define a family of protocols…

Quantum Physics · Physics 2021-05-14 Ayal Green

To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that…

"Classical shadows" are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state [Nature Physics 16, 1050-1057]. Here, we analyze classical shadows obtained using random…

Quantum Physics · Physics 2023-11-28 Kianna Wan , William J. Huggins , Joonho Lee , Ryan Babbush

Recently, quantum computing experiments have for the first time exceeded the capability of classical computers to perform certain computations -- a milestone termed "quantum computational advantage." However, verifying the output of the…

Quantum Physics · Physics 2023-09-13 Gregory D. Kahanamoku-Meyer

We introduce the problem of *shadow tomography*: given an unknown $D$-dimensional quantum mixed state $\rho$, as well as known two-outcome measurements $E_{1},\ldots,E_{M}$, estimate the probability that $E_{i}$ accepts $\rho$, to within…

Quantum Physics · Physics 2018-11-14 Scott Aaronson

Authentication provides the trust people need to engage in transactions. The advent of physical keys that are impossible to copy promises to revolutionize this field. Up to now, such keys have been verified by classical challenge-response…

Quantum Convolutional Neural Networks (QCNNs) are widely regarded as a promising model for Quantum Machine Learning (QML). In this work we tie their heuristic success to two facts. First, that when randomly initialized, they can only…

Quantum Physics · Physics 2026-04-07 Pablo Bermejo , Paolo Braccia , Manuel S. Rudolph , Zoë Holmes , Lukasz Cincio , M. Cerezo

Classical shadow tomography provides an efficient method for predicting functions of an unknown quantum state from a few measurements of the state. It relies on a unitary channel that efficiently scrambles the quantum information of the…

Quantum Physics · Physics 2022-02-01 Hong-Ye Hu , Yi-Zhuang You

Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estimation is quite limited compared with the qubit setting. Here…

Quantum Physics · Physics 2025-04-30 Chengsi Mao , Changhao Yi , Huangjun Zhu

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…

Quantum Physics · Physics 2020-04-16 Narayanan Rengaswamy

We generalize the classical shadow tomography scheme to a broad class of finite-depth or finite-time local unitary ensembles, known as locally scrambled quantum dynamics, where the unitary ensemble is invariant under local basis…

Quantum Physics · Physics 2025-10-27 Hong-Ye Hu , Soonwon Choi , Yi-Zhuang You

Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can…

Quantum Physics · Physics 2018-07-10 Alexandru Gheorghiu , Theodoros Kapourniotis , Elham Kashefi
‹ Prev 1 3 4 5 6 7 10 Next ›