Minimal computational-space implementation of multi-round quantum protocols
classification
🪐 quant-ph
keywords
quantumcomputational-spacemulti-roundconnectedefficienthereimplementationimplemented
read the original abstract
A single-party strategy in a multi-round quantum protocol can be implemented by sequential networks of quantum operations connected by internal memories. Here provide the most efficient realization in terms of computational-space resources.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.