Re-uploading quantum data: a universal function approximator for quantum inputs
Quantum data re-uploading has proved powerful for classical inputs, where repeatedly encoding features into a small circuit yields universal function approximation. Extending this idea to quantum inputs remains underexplored, as the information contained in a quantum state is not directly accessible in classical form. We propose and analyze a quantum data re-uploading architecture in which a qubit interacts sequentially with fresh copies of an arbitrary input state. The circuit can approximate any bounded continuous function using only one ancilla qubit and single-qubit measurements, provided that sufficiently many copies of the input state and, in general, sufficiently many layers are available. By alternating entangling unitaries with mid-circuit resets of the input register, the architecture realizes a discrete cascade of completely positive and trace-preserving maps, analogous to collision models in open quantum system dynamics. Our framework provides a space-efficient and expressive approach to designing quantum machine learning models that operate directly on quantum data.
Authors
- Daniel K. Park (ORCID: https://orcid.org/0000-0002-3177-4143)
- Jungwoo Lee (ORCID: https://orcid.org/0000-0002-6804-980X)
- Hyun-Ho Cha (ORCID: https://orcid.org/0009-0008-2933-6989)
Institutions
- Seoul National University (KR)
- Yonsei University (KR)
Publication Details
- Journal
- Quantum
- Published
- 2026-10-29
- DOI
- https://doi.org/10.22331/q-2026-10-29-2256
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Seoul National University
- National Research Foundation of Korea
- Ministry of Science and ICT, South Korea
- Institute for Information and Communications Technology Promotion