Classical shadow
In Quantum computing, the Classical shadow is a protocol for predicting functions of a quantum state using only a logarithmic number of measurements. Given an unknown state , a tomographically complete set of gates (e.g Clifford gates), a set of Observables and a quantum channel (defined by randomly sampling from , applying it to and measuring the resulting state); predict the expectation values . A list of Classical shadows is created using , and by running a Shadow generation algorithm. When predicting the properties of , a Median-of-means estimation algorithm is used to deal with the outliers in . The Classical shadow is useful for Direct fidelity estimation and Entanglement verification.
primaryTopic
Classical shadow
In Quantum computing, the Classical shadow is a protocol for predicting functions of a quantum state using only a logarithmic number of measurements. Given an unknown state , a tomographically complete set of gates (e.g Clifford gates), a set of Observables and a quantum channel (defined by randomly sampling from , applying it to and measuring the resulting state); predict the expectation values . A list of Classical shadows is created using , and by running a Shadow generation algorithm. When predicting the properties of , a Median-of-means estimation algorithm is used to deal with the outliers in . The Classical shadow is useful for Direct fidelity estimation and Entanglement verification.
has abstract
In Quantum computing, the Clas ...... d outputs the following value.
@en
Wikipage page ID
67,578,967
page length (characters) of wiki page
Wikipage revision ID
1,021,467,707
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In Quantum computing, the Clas ...... and Entanglement verification.
@en
label
Classical shadow
@en