Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Pashayan, Hakop"'
We prove that using global observables to train the matrix product state ansatz results in the vanishing of all partial derivatives, also known as barren plateaus, while using local observables avoids this. This ansatz is widely used in quantum machi
Externí odkaz:
http://arxiv.org/abs/2409.10055
Publikováno v:
Proceedings of Thirty Seventh Conference on Learning Theory (COLT 2024), PMLR 247:2122-2165
Given many copies of an unknown quantum state $\rho$, we consider the task of learning a classical description of its principal eigenstate. Namely, assuming that $\rho$ has an eigenstate $|\phi\rangle$ with (unknown) eigenvalue $\lambda > 1/2$, the g
Externí odkaz:
http://arxiv.org/abs/2405.13939
We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol oscillating rather than decaying exponentially. To illustrate our idea, we first construct an example in standard randomized
Externí odkaz:
http://arxiv.org/abs/2212.05488
Publikováno v:
Quantum 8, 1373 (2024)
We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state $\rho$ in order to learn a classical description which suffices to later esti
Externí odkaz:
http://arxiv.org/abs/2211.11810
Autor:
Bertoni, Christian, Haferkamp, Jonas, Hinsche, Marcel, Ioannou, Marios, Eisert, Jens, Pashayan, Hakop
Publikováno v:
Phys. Rev. Lett. 133, 020602 (2024)
We provide practical and powerful schemes for learning many properties of an unknown n-qubit quantum state using a sparing number of copies of the state. Specifically, we present a depth-modulated randomized measurement scheme that interpolates betwe
Externí odkaz:
http://arxiv.org/abs/2209.12924
Publikováno v:
Quantum 5, 606 (2021)
In this work we improve the runtime of recent classical algorithms for strong simulation of quantum circuits composed of Clifford and T gates. The improvement is obtained by establishing a new upper bound on the stabilizer rank of $m$ copies of the m
Externí odkaz:
http://arxiv.org/abs/2106.07740
Publikováno v:
PRX Quantum 3 (2022) 020361
We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each other by
Externí odkaz:
http://arxiv.org/abs/2101.12223
Publikováno v:
PRX Quantum 2, 010345 (2021)
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by establishing pre
Externí odkaz:
http://arxiv.org/abs/2002.06181
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Quantum 4, 223 (2020)
Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits can be efficiently simulated with a probabilistic classical
Externí odkaz:
http://arxiv.org/abs/1712.02806