activity
20232026
most citedOn the Computational Hardness of Quantum One-Wayness

4 citations · 4 across the 6 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph2026

Pretty good shadow tomography

Sabee Grewal, Angelos Pelecanos, Jack Spilecki +2

We give a shadow tomography algorithm that uses copies of the input state. Specifically, given a quantum state and observables $O_1,\ldot…

quant-ph2026

Online Shadow Tomography Matching the Classical Bounds

Sitan Chen, Ryan O'Donnell, Angelos Pelecanos +1

In Online Shadow Tomography, we are given copies of an unknown -dimensional quantum state , an adversary (adaptively) proposes a sequence of bounded observables $A^{(1)},\ldo…

quant-ph2026

The Keyl-Werner algorithm is not optimal for spectrum estimation

Angelos Pelecanos, Jack Spilecki, Ewin Tang +1

We give an algorithm which, given copies of , estimates the eigenvalues of to constant error in total variation distance. Thus, we…

quant-ph2025

Mixed state tomography reduces to pure state tomography

Angelos Pelecanos, Jack Spilecki, Ewin Tang +1

A longstanding belief in quantum tomography is that estimating a mixed state is far harder than estimating a pure state. This is borne out in the mathematics, where mixed state alg…

quant-ph2025

The debiased Keyl's algorithm: a new unbiased estimator for full state tomography

Angelos Pelecanos, Jack Spilecki, John Wright

In the problem of quantum state tomography, one is given copies of an unknown rank- mixed state and asked to produce an estimator of . In t…

quant-ph2025

Beating full state tomography for unentangled spectrum estimation

Angelos Pelecanos, Xinyu Tan, Ewin Tang +1

How many copies of a mixed state are needed to learn its spectrum? To date, the best known algorithms for spectrum estimation require as many copies…

quant-ph2023

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

Xingjian Li, Qipeng Liu, Angelos Pelecanos +1

It is a long-standing open question to construct a classical oracle relative to which BQP/qpoly BQP/poly or QMA QCMA. In this paper, we construct classically-accessib…