Quantum error mitigated classical shadows
Classical shadows enable us to learn many properties of a quantum state ρ with very few measurements. However, near-term and early fault-tolerant quantum computers will only be able to prepare noisy quantum states ρ and it is thus a considerable challenge to efficiently learn properties of an ideal,...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
American Physical Society
2024
|
| _version_ | 1826312481697431552 |
|---|---|
| author | Jnane, H Steinberg, J Cai, Z Nguyen, HC Koczor, B |
| author_facet | Jnane, H Steinberg, J Cai, Z Nguyen, HC Koczor, B |
| author_sort | Jnane, H |
| collection | OXFORD |
| description | Classical shadows enable us to learn many properties of a quantum state ρ with very few measurements. However, near-term and early fault-tolerant quantum computers will only be able to prepare noisy quantum states ρ and it is thus a considerable challenge to efficiently learn properties of an ideal, noise-free state ρ<sub>id</sub>. We consider error mitigation techniques, such as probabilistic error cancelation (PEC), zero noise extrapolation (ZNE), and symmetry verification (SV), which have been developed for mitigating errors in single expected value measurements and generalize them for mitigating errors in classical shadows. We find that PEC is the most natural candidate and thus develop a thorough theoretical framework for PEC shadows with the following rigorous theoretical guarantees: PEC shadows are an unbiased estimator for the ideal quantum state ρ<sub>id</sub>; the sample complexity for simultaneously predicting many linear properties of ρ<sub>id</sub> is identical to that of the conventional shadows approach up to a multiplicative factor, which is the sample overhead due to error mitigation. Due to efficient postprocessing of shadows, this overhead does not depend directly on the number of qubits but rather grows exponentially with the number of noisy gates. The broad set of tools introduced in this work may be instrumental in exploiting near-term and early fault-tolerant quantum computers: we demonstrate in detailed numerical simulations a range of practical applications of quantum computers that will significantly benefit from our techniques. |
| first_indexed | 2024-03-07T08:17:38Z |
| format | Journal article |
| id | oxford-uuid:bb9b7a37-b7be-4ec8-a2e2-18a77ae39971 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-04-09T03:55:14Z |
| publishDate | 2024 |
| publisher | American Physical Society |
| record_format | dspace |
| spelling | oxford-uuid:bb9b7a37-b7be-4ec8-a2e2-18a77ae399712024-03-07T12:56:00ZQuantum error mitigated classical shadowsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:bb9b7a37-b7be-4ec8-a2e2-18a77ae39971EnglishSymplectic ElementsAmerican Physical Society2024Jnane, HSteinberg, JCai, ZNguyen, HCKoczor, BClassical shadows enable us to learn many properties of a quantum state ρ with very few measurements. However, near-term and early fault-tolerant quantum computers will only be able to prepare noisy quantum states ρ and it is thus a considerable challenge to efficiently learn properties of an ideal, noise-free state ρ<sub>id</sub>. We consider error mitigation techniques, such as probabilistic error cancelation (PEC), zero noise extrapolation (ZNE), and symmetry verification (SV), which have been developed for mitigating errors in single expected value measurements and generalize them for mitigating errors in classical shadows. We find that PEC is the most natural candidate and thus develop a thorough theoretical framework for PEC shadows with the following rigorous theoretical guarantees: PEC shadows are an unbiased estimator for the ideal quantum state ρ<sub>id</sub>; the sample complexity for simultaneously predicting many linear properties of ρ<sub>id</sub> is identical to that of the conventional shadows approach up to a multiplicative factor, which is the sample overhead due to error mitigation. Due to efficient postprocessing of shadows, this overhead does not depend directly on the number of qubits but rather grows exponentially with the number of noisy gates. The broad set of tools introduced in this work may be instrumental in exploiting near-term and early fault-tolerant quantum computers: we demonstrate in detailed numerical simulations a range of practical applications of quantum computers that will significantly benefit from our techniques. |
| spellingShingle | Jnane, H Steinberg, J Cai, Z Nguyen, HC Koczor, B Quantum error mitigated classical shadows |
| title | Quantum error mitigated classical shadows |
| title_full | Quantum error mitigated classical shadows |
| title_fullStr | Quantum error mitigated classical shadows |
| title_full_unstemmed | Quantum error mitigated classical shadows |
| title_short | Quantum error mitigated classical shadows |
| title_sort | quantum error mitigated classical shadows |
| work_keys_str_mv | AT jnaneh quantumerrormitigatedclassicalshadows AT steinbergj quantumerrormitigatedclassicalshadows AT caiz quantumerrormitigatedclassicalshadows AT nguyenhc quantumerrormitigatedclassicalshadows AT koczorb quantumerrormitigatedclassicalshadows |