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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Re-uploading quantum data: a universal function approximator for quantum inputs

Daniel K. Park, Jungwoo Lee, Hyun-Ho Cha
3 links
Quantum
Quantum Computing Algorithms and Architecture
article

Re-uploading quantum data: a universal function approximator for quantum inputs

Daniel K. Park, Jungwoo Lee, Hyun-Ho Cha
article en

Abstract

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.

QuantumVol. 10
Seoul National University (KR), Yonsei University (KR)
Seoul National University, National Research Foundation of Korea, Ministry of Science and ICT, South Korea, Institute for Information and Communications Technology Promotion
Openalex Percentile: Top 14%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Re-uploading quantum data: a universal function approximator for quantum inputs — Daniel K. Park, Jungwoo Lee, et al. · Quantum (2026) | TGRS Research Map | TGRS