paper-with-me

홈 › Papers

Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements

2023-08-14 · Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang

Recent work has shown that $n$-qubit quantum states output by circuits with at most $t$ single-qubit non-Clifford gates can be learned to trace distance $\epsilon$ using $\mathsf{poly}(n,2^t,1/\epsilon)$ time and samples. All prior algorithms achieving this runtime use entangled measurements across two copies of the input state. In this work, we give a similarly efficient algorithm that learns the same class of states using only single-copy measurements.

📄 PDF Abstract BibTeX arXiv:2308.07175

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates

2023-05-22 · Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang

We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Cliffor…

Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation

2024-08-13 · Sitan Chen, Weiyuan Gong, Qi Ye, Zhihan Zhang

We study the task of agnostic tomography: given copies of an unknown $n$-qubit state $\rho$ which has fidelity $\tau$ with some state in a given class $C$, find a state which has fidelity $\ge \tau - \epsilon$ with $\rho…

Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis

2026-05-11 · Richie Yeung, Aleks Kissinger, Rob Cornish arxiv

We consider the problem of synthesizing Clifford quantum circuits for devices with all-to-all qubit connectivity. We approach this task as a reinforcement learning problem in which an agent learns to discover a sequence …

Reinforcement Learning

T-Count Optimizing Genetic Algorithm for Quantum State Preparation

2024-06-06 · Andrew Wright, Marco Lewis, Paolo Zuliani, Sadegh Soudjani

Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The probl…

Clifford Circuits can be Properly PAC Learned if and only if $\textsf{RP}=\textsf{NP}$

2022-04-13 · Daniel Liang

Given a dataset of input states, measurements, and probabilities, is it possible to efficiently predict the measurement probabilities associated with a quantum circuit? Recent work of Caro and Datta (2020) studied the pr…

Computational EfficiencyPAC learning