activity
20082021
most citedSuccess-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation

20 citations · 45 across the 7 of their papers we have counts for

collaborators
Showing quant-phShow all

13 papers · 1 filter

quant-ph2021

Transferring quantum information between a quantum system with limited control and a quantum computer

Ryosuke Sakai, Akihito Soeda, Mio Murao

We consider a hybrid quantum system consisting of a qubit system continuously evolving according to its fixed own Hamiltonian and a quantum computer. The qubit system couples to a…

quant-ph2021

Optimal quantum discrimination of single-qubit unitary gates between two candidates

Akihito Soeda, Atsushi Shimbo, Mio Murao

We analyze a discrimination problem of a single-qubit unitary gate with two candidates, where the candidates are not provided with their classical description, but their quantum sa…

quant-ph202020 cited

Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation

Qingxiuxiong Dong, Marco Túlio Quintino, Akihito Soeda +1

Repeat-until-success strategy is a standard method to obtain success with a probability which grows exponentially in the number of iterations. However, since quantum systems are di…

quant-ph2019

Probabilistic exact universal quantum circuits for transforming unitary operations

Marco Túlio Quintino, Qingxiuxiong Dong, Atsushi Shimbo +2

This paper addresses the problem of designing universal quantum circuits to transform uses of a -dimensional unitary input-operation into a unitary output-operation in a pro…

quant-ph2019

Robust controllability of two-qubit Hamiltonian dynamics

Ryosuke Sakai, Akihito Soeda, Mio Murao +1

Quantum gates (unitary gates) on physical systems are usually implemented by controlling the Hamiltonian dynamics. When full descriptions of the Hamiltonians parameters is availabl…

quant-ph2018

Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement

Eyuri Wakakuwa, Akihito Soeda, Mio Murao

We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information proces…