9 citations · 11 across the 6 of their papers we have counts for
6 papers
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…
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…
Robust Error Accumulation Suppression for Quantum Circuits
Tatsuki Odake, Philip Taranto, Nobuyuki Yoshioka +4
We present a \textit{robust error accumulation suppression} (\textbf{REAS}) technique to manage errors in quantum computers. Our method reduces the accumulation of errors in any qu…
Universal algorithm for transforming Hamiltonian eigenvalues
Tatsuki Odake, Hlér Kristjánsson, Philip Taranto +1
Manipulating Hamiltonians governing physical systems has found a broad range of applications, from quantum chemistry to semiconductor design. In this work, we provide a new way of…
Higher-order quantum transformations of Hamiltonian dynamics
Tatsuki Odake, Hlér Kristjánsson, Akihito Soeda +1
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed…