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.
Minimal computational-space implementation of multi-round quantum protocols
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).
- Constant-round Multi-party Quantum Computation for Constant Parties (2020)61% match
- On The Round Complexity of Secure Quantum Computation (2020)61% match
- Design and Experimental Realization of Various Protocols for Secure Quantum Computation and Communication (2025)60% match
- Multi-party Quantum Computation (2001)60% match
- Secure multi-party quantum computation with few qubits (2020)60% match
- Automated distribution of quantum circuits via hypergraph partitioning (2018)59% match
- Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes (2022)59% match
- Remote Implementations Of Partially Unknown Quantum Operations Of Multiqubits (2005)59% match