13 papers · 1 filter
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…
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…
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…
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…
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.…