An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning
Abstract
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-box channel access and ii) access to a Stinespring dilation unitary of the channel along with its inverse. We consider the task of learning how close the unknown channel is to the set of unitary channels. This is characterized by the \textit{optimal average gate fidelity (OAGF)}, defined as the average gate fidelity maximized over all unitary channels. For constant Kraus rank and a dilation environment of dimension polylog(d), we provide an algorithm that estimates the OAGF to fixed additive accuracy using polylog(d) queries to the Stinespring dilation unitary and its inverse. In contradistinction, under the black-box access model, this estimation requires at least Ω(√d) queries, even for channels of constant Kraus rank and constant additive accuracy. As a corollary, we rule out a universal simulator that uses only poly(log d,q) queries to the unknown channel to approximate the output of arbitrary q-query algorithms with access to a randomly-sampled Stinespring dilation unitary and its inverse, even to sufficiently small constant error. These results demonstrate that access to the system-environment joint evolution and its inverse can provide an exponential advantage in estimating an intrinsic property of a quantum channel.
Related
- Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries
- Exponential advantage in continuous-variable quantum state learning
- Exponential Entanglement Advantage in Sensing Correlated Noise
- An Exponential Sample-Complexity Advantage for Coherent Quantum Inference
- Exponential Quantum Advantage in Numbers-on-Forehead Communication
BibTeX
@misc{arihara2026exponential,
title = {{An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning}},
author = {Manaki Arihara and Satoshi Yoshida and Philip Taranto and Mio Murao},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.40001},
eprint = {2609.40001},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.40001},
}
RIS
TY - UNPB
TI - An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning
AU - Manaki Arihara
AU - Satoshi Yoshida
AU - Philip Taranto
AU - Mio Murao
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.40001
UR - https://arxiv.org/abs/2609.40001
AB - 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-box channel access and ii) access to a Stinespring dilation unitary of the channel along with its inverse. We consider the task of learning how close the unknown channel is to the set of unitary channels. This is characterized by the \textit{optimal average gate fidelity (OAGF)}, defined as the average gate fidelity maximized over all unitary channels. For constant Kraus rank and a dilation environment of dimension polylog(d), we provide an algorithm that estimates the OAGF to fixed additive accuracy using polylog(d) queries to the Stinespring dilation unitary and its inverse. In contradistinction, under the black-box access model, this estimation requires at least Ω(√d) queries, even for channels of constant Kraus rank and constant additive accuracy. As a corollary, we rule out a universal simulator that uses only poly(log d,q) queries to the unknown channel to approximate the output of arbitrary q-query algorithms with access to a randomly-sampled Stinespring dilation unitary and its inverse, even to sufficiently small constant error. These results demonstrate that access to the system-environment joint evolution and its inverse can provide an exponential advantage in estimating an intrinsic property of a quantum channel.
ER -