Quantum Fire with Delegated Cloning
Abstract
Quantum fire is a recently introduced cryptographic primitive consisting of efficiently preparable quantum states, called \emph{flames}, that admit efficient cloning but resist efficient telegraphing, namely reconstruction via classical communication without preshared entanglement. In all prior constructions of quantum fire, cloning is a public operation that requires no separate key and every holder of a flame state can clone it. For applications to access control, however, an issuer may wish to delegate cloning to designated quantum servers while withholding this capability from other flame holders. To address this, we introduce \emph{delegatable quantum fire}, in which cloning requires a separate key. We give two constructions in the classical-oracle model. Our first construction uses a classical secret key which enables cloning, and any user with the entire key may clone successfully. Our second construction, which we call \emph{torch-fire}, uses quantum cloning keys, called \emph{torches}, which enable cloning while remaining unaffected in the process but cannot otherwise be split or delegated to enable additional cloning. An efficient adversary given m torches cannot, except with negligible probability, enable more than m noncommunicating parties to each clone a fresh, independently issued challenge flame. The adversary may jointly process its resources before separating the parties and distribute arbitrarily entangled registers among them. Both constructions are in the oracle model, relying on public classical oracles that allow queries in quantum superposition.
Related
- Verifiable Sampling for Delegated Generative Quantum Machine Learning
- Encrypted cloning of qubits is able to serve as a quantum primitive, already on non-error-corrected quantum hardware
- Asymmetric quantum cloning on orthogonal orbits and four-mode fermionic states
- Noise Propagation and Effective Channels in Encrypted Quantum Cloning
- Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning
BibTeX
@misc{chatterjee2026quantum,
title = {{Quantum Fire with Delegated Cloning}},
author = {Rohit Chatterjee and Ananta Mukherjee and Vir Pathak and Supartha Podder},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03593},
eprint = {2610.03593},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03593},
}
RIS
TY - UNPB
TI - Quantum Fire with Delegated Cloning
AU - Rohit Chatterjee
AU - Ananta Mukherjee
AU - Vir Pathak
AU - Supartha Podder
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.03593
UR - https://arxiv.org/abs/2610.03593
AB - Quantum fire is a recently introduced cryptographic primitive consisting of efficiently preparable quantum states, called \emph{flames}, that admit efficient cloning but resist efficient telegraphing, namely reconstruction via classical communication without preshared entanglement. In all prior constructions of quantum fire, cloning is a public operation that requires no separate key and every holder of a flame state can clone it. For applications to access control, however, an issuer may wish to delegate cloning to designated quantum servers while withholding this capability from other flame holders. To address this, we introduce \emph{delegatable quantum fire}, in which cloning requires a separate key. We give two constructions in the classical-oracle model. Our first construction uses a classical secret key which enables cloning, and any user with the entire key may clone successfully. Our second construction, which we call \emph{torch-fire}, uses quantum cloning keys, called \emph{torches}, which enable cloning while remaining unaffected in the process but cannot otherwise be split or delegated to enable additional cloning. An efficient adversary given m torches cannot, except with negligible probability, enable more than m noncommunicating parties to each clone a fresh, independently issued challenge flame. The adversary may jointly process its resources before separating the parties and distribute arbitrarily entangled registers among them. Both constructions are in the oracle model, relying on public classical oracles that allow queries in quantum superposition.
ER -