28 citations · 36 across the 15 of their papers we have counts for
18 papers
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…
Random dilation superchannel
Satoshi Yoshida, Ryotaro Niwa, Takeru Utsumi +2
We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries…
Higher-order quantum computing with known input states
Vanessa Brzić, Satoshi Yoshida, Mio Murao +1
In higher-order quantum computing (HOQC), one typically considers the universal transformation of unknown quantum operations, treated as blackboxes. It is also implicitly assumed t…
Asymptotically optimal unitary estimation in by the analysis of graph Laplacian
Satoshi Yoshida, Hironobu Yoshida, Mio Murao
Unitary estimation is the task to estimate an unknown unitary operator with queries to the corresponding unitary operation, and its accuracy is evaluated b…
Quantum Advantage in Storage and Retrieval of Isometry Channels
Satoshi Yoshida, Jisho Miyazaki, Mio Murao
Storage and retrieval refer to the task of encoding an unknown quantum channel into a quantum state, known as the program state, such that the channel can later be retrieved. T…
Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits
Hlér Kristjánsson, Tatsuki Odake, Satoshi Yoshida +4
Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of comp…
Simulating the quantum switch with quantum circuits is computationally hard
Jessica Bavaresco, Hlér Kristjánsson, Mio Murao +4
Higher-order transformations acting on input quantum channels in an indefinite causal order, such as the quantum switch, cannot be described by quantum circuits using the same numb…
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Frédéric Grosshans, Michał Horodecki, Mio Murao +4
This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of \textit{multicopy state telepor…
One-to-One Correspondence between Deterministic Port-Based Teleportation and Unitary Estimation
Satoshi Yoshida, Yuki Koizumi, Michał Studziński +2
Port-based teleportation is a variant of quantum teleportation, where the receiver can choose one of the ports in his part of the entangled state shared with the sender, but cannot…
Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations
Tatsuki Odake, Satoshi Yoshida, Mio Murao
Recent developments have revealed deterministic and exact protocols for performing complex conjugation, inversion, and transposition of a general -dimensional unknown unitary op…
Universal adjointation of isometry operations using conversion of quantum supermaps
Satoshi Yoshida, Akihito Soeda, Mio Murao
Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transform…
Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
Satoshi Yoshida, Akihito Soeda, Mio Murao
We report a deterministic and exact protocol to reverse any unknown qubit-unitary operation, which simulates the time inversion of a closed qubit system. To avoid known no-go resul…