Search arXiv⌕ Search

arXiv · 2611.09760

Scalable Unitary State-Encoding for Generic Large Data

Abstract

Efficient encoding of data into quantum states remains a fundamental bottleneck in many quantum computing protocols, which would otherwise offer advantages over their classical counterparts. Here, we introduce deterministic and scalable amplitude-encoding methods with low two-qubit gate costs and tunable trade-offs between circuit depth and encoding fidelity. Our approaches require no amplitude amplification or mid-circuit measurement and are capable of encoding arbitrary complex data or queryable functions by using tensor-networks to go beyond what can be held in classical memory. Our principle contributions are two complementary algorithms for simplifying fully controlled multiplexer circuits to one- and two-qubit gates. In the first, we formally map the elimination of redundant gate controls to a Boolean logic minimization problem, while in the second we utilize a single ancilla qubit to map the multi-controlled rotation gates to a sequence of one- and two-qubit operations via the Walsh-Hadamard spectrum of the gate angles. We benchmark these methods across a broad range of function classes, characterizing their total depth in an all-to-all connectivity graph against system size and target fidelity. Hybridizing our methods gives up to orders of magnitude improvement in circuit depth at equivalent state fidelity compared to the default state-preparation method in the Qiskit package. We furthermore demonstrate our method on IQM hardware with a square lattice connectivity, finding excellent fidelity, even with minimal noise mitigation. By significantly reducing gate depth for encoding, this work enables the experimental execution of applications on current and near-term hardware which would otherwise be reduced to noise before the first calculation step, shortening the time horizon to robust quantum utility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vittorio Pagni, Peter K. Schuhmacher, Michael Felderer, Michael Epping, Kevin Lively. 2026-11-06. Scalable Unitary State-Encoding for Generic Large Data. https://arxiv.org/abs/2611.09760

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Certified Lipschitz Bounds for Hybrid Quantum-Classical Decision Models

We study certified upper bounds on Lipschitz constants for hybrid quantum-classical decision models, which combine classical neural-network layers with parameterized quantum circuits. We pair an SDP-based certificate for classical layers with an exact spectral characterization for probability-output quantum models. For hybrid architectures, these componentwise estimates are connected through the encoding maps to obtain a certified composition bound for the complete model. The resulting bounds support sensitivity analyses relevant to robustness, stability, generalization, and fairness.

quant-ph↗

Quantum-to-classical transition and the emergence of trajectory level Darwinism with measurements distributed in time: a path integral approach

We present a formulation for the emergence of classical dynamics in a quantum world using a path integral approach that incorporates continuous measurements. It complements decoherence and coarse-grained measurement frameworks. The formulation provides the joint statistics of a sequence of measurements, with each Feynman path picking up a random phase proportional to the measurement strength, and we give conditions under which trajectories near classical paths dominate the probability amplitude. Information proliferates across the environment, a key feature of quantum Darwinism, via plane-wave probe scattering. In the continuous limit, momentum kicks from the probes add a further phase to each trajectory--the origin of the back-action force. We provide conditions under which measurements yield enough ``which-path'' information while keeping the wave packet localized. This describes the quantum-to-classical transition at the level of individual measurement records, complementing the ensemble description by density matrices. The same scattering that decoheres a trajectory also heats it, tying decoherence and measurement back-action together. This bounds how redundantly a classical trajectory can be recorded before back-action randomizes it into Brownian motion. The bound is not restrictive for macroscopic systems. For a trapped particle, it is set by the resolution in units of the zero-point motion and collapses to a single record where the semiclassical description of the orbit fails; for a free coordinate it marks the loss of deterministic objectivity even while the classical action remains large. In both cases, it delimits the regime in which objective classical trajectories exist. The crossover is driven by photon recoil, already resolved in levitated optomechanics; the bound recasts it as the point where a redundantly recorded trajectory, still objective, stops being deterministic.

quant-ph↗

Simulating Gaussian boson sampling on graphs in polynomial time

We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide exponential speedup for these applications. We also show that another distribution related to Boson sampling can be sampled classically in polynomial time.

quant-ph↗