Cover Image

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Acharya, Jayadev, Dharmavarapu, Abhilash, Liu, Yuhan, Yu, Nengkun
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Pauli measurements are not optimal for single-copy tomography
by: Acharya, Jayadev, et al.
Published: (2025)

Quantum state testing with restricted measurements
by: Liu, Yuhan, et al.
Published: (2024)

The role of shared randomness in quantum state certification with unentangled measurements
by: Liu, Yuhan, et al.
Published: (2024)

Shadow Tomography Against Adversaries
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
by: Silva, Jefferson D. S., et al.
Published: (2025)

On the Pauli Spectrum of QAC0
by: Nadimpalli, Shivam, et al.
Published: (2023)

Efficient approximate unitary designs from random Pauli rotations
by: Haah, Jeongwan, et al.
Published: (2024)

Hardness results for decoding the surface code with Pauli noise
by: Fischer, Alex, et al.
Published: (2023)

Qubit Routing for (Almost) Free
by: de Griend, Arianne Meijer-van
Published: (2026)

Solving The Travelling Salesman Problem Using A Single Qubit
by: Goswami, Kapil, et al.
Published: (2024)

The Space Just Above One Clean Qubit
by: Jacobs, Dale, et al.
Published: (2024)

Virtual Qudits for Simon's Problem: Dimension-Lifted Algorithms on Qubit Hardware
by: Semre, Abed, et al.
Published: (2025)

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
by: Aaronson, Scott, et al.
Published: (2023)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
by: Martinez, Victor, et al.
Published: (2025)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
by: Onah, Chinonso, et al.
Published: (2026)

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
by: Kahanamoku-Meyer, Gregory D., et al.
Published: (2024)

Quantum Event Learning and Gentle Random Measurements
by: Watts, Adam Bene, et al.
Published: (2022)

Nearly Time-Optimal Pure State Tomography with Pauli Measurements
by: Grewal, Sabee, et al.
Published: (2026)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
by: Grewal, Sabee, et al.
Published: (2025)

Nonlocal Games in the High-Noise Regime: Optimal Quantum Values and Rigidity
by: Fu, Honghao, et al.
Published: (2025)

3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
by: Chia, Nai-Hui, et al.
Published: (2025)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
by: Miloschewsky, David, et al.
Published: (2024)

Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
by: Suruga, Daiki
Published: (2025)

Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
by: Fefferman, Bill, et al.
Published: (2024)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
by: Aaronson, Scott, et al.
Published: (2024)

Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
by: Kornerup, Niels, et al.
Published: (2021)

Adaptivity is not helpful for Pauli channel learning
by: Trinh, Xuan Du, et al.
Published: (2024)

Improved Quantum Lifting by Coherent Measure-and-Reprogram
by: Cojocaru, Alexandru, et al.
Published: (2025)

Lower Bounds for Learning Quantum States with Single-Copy Measurements
by: Lowe, Angus, et al.
Published: (2022)

Fermionic Gaussian Testing and Non-Gaussian Measures via Convolution
by: Lyu, Xingjian, et al.
Published: (2024)

Efficient Pauli channel estimation with logarithmic quantum memory
by: Chen, Sitan, et al.
Published: (2023)

Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm
by: Yao, Jiaqi, et al.
Published: (2026)

Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
by: Li, Tongyang, et al.
Published: (2025)

Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
by: Liu, Yupan, et al.
Published: (2026)

QMA vs. QCMA and Pseudorandomness
by: Liu, Jiahui, et al.
Published: (2024)

StoqMA vs. MA: the power of error reduction
by: Aharonov, Dorit, et al.
Published: (2020)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
by: Liu, Zhenning, et al.
Published: (2024)

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
by: Rajakumar, Joel, et al.
Published: (2024)