28 citations · 36 across the 15 of their papers we have counts for
7 papers · 2 filters
An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning
Manaki Arihara, Satoshi Yoshida, Philip Taranto +1
We present a learning task for quantum channels that exhibits an exponential separation in query complexity (in terms of the number of qubits) between two access models: i) black-b…
Optimal learning of covariant quantum states and channels
Satoshi Yoshida, Kazuki Okigami, Pietro M. Posta +1
We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. F…
Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries
Natsuto Isogai, Satoshi Yoshida, Mio Murao
Whether quantum computation can reduce the amount of data sampled from an unknown probability distribution required to learn a prediction rule is a fundamental question in quantum…
Asymptotically optimal purification of noisy unitary channels in any dimension
Ryotaro Niwa, Satoshi Yoshida, Mio Murao
We consider the problem of noisy unitary purification. Given access to an unknown -dimensional unitary channel followed by depolarizing noise of strength , we aim to construc…
Optimal complex conjugation of unknown isometry channels
Satoshi Yoshida, Mio Murao
Access to the complex conjugate of an unknown quantum channel is a useful resource in quantum oracle problems, motivating the question of how such access can be simulated using onl…
Scaling-optimal purification of noisy qubit unitary channels
Ryotaro Niwa, Satoshi Yoshida, Koki Ono +5
We consider the problem of purifying noisy qubit unitary channels. Given the ability to apply an unknown qubit unitary channel followed by depolarizing noise, we aim to construct a…
Proof of a finite threshold for the union-find decoder
Satoshi Yoshida, Ethan Lake, Hayata Yamasaki
Fast decoders that achieve strong error suppression are essential for fault-tolerant quantum computation (FTQC) from both practical and theoretical perspectives. The union-find (UF…