activity
20232026
most citedSimulating the quantum switch with quantum circuits is computationally hard

2 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph2026

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…

quant-ph2025

Singular value transformation for unknown quantum channels

Ryotaro Niwa, Zane Marius Rossi, Philip Taranto +1

Given the ability to apply an unknown quantum channel acting on a -dimensional system, we develop a quantum algorithm for transforming its singular values. The spectrum of a qua…

quant-ph2025★ 1 cited

Higher-Order Quantum Operations

Philip Taranto, Simon Milz, Mio Murao +2

An operational description of quantum phenomena concerns developing models that describe experimentally observed behaviour. $\textit{Higher-order quantum operations}\unicode{x2014}…

quant-ph2024

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…

quant-ph2024★ 2 cited

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…

quant-ph2024

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…

quant-ph2023

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…