We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an -dimensional state in depth and (a metric that accounts for the fact that oftentimes some ancilla qubits need not be active for the entire circuit) , which are both optimal. When compiled into the gate set, we show that it requires asymptotically fewer quantum resources than previous methods. Specifically, it prepares an arbitrary state up to error with optimal depth of and spacetime allocation , improving over and , respectively. We illustrate how the reduced spacetime allocation of our protocol enables rapid preparation of many disjoint states with only constant-factor ancilla overhead – ancilla qubits are reused efficiently to prepare a product state of -dimensional states in depth rather than , achieving effectively constant depth per state. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations. We provide quantum circuit descriptions of our protocol, detailed pseudocode, and gate-level implementation examples using Braket.
more »
« less
This content will become publicly available on March 27, 2026
On the Computational Hardness of Quantum One-Wayness
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent computational assumptions to be realized. Furthermore, the existence of either of these primitives implies that , which gives a lower bound on the necessary hardness.One can also define versions of each of these primitives with quantum output: respectively one-way state generators and pseudorandom state generators. Unlike in the classical setting, it is not known whether either primitive can be built from the other. Although it has been shown that pseudorandom state generators for certain parameter regimes can be used to build one-way state generators, the implication has not been previously known in full generality. Furthermore, to the best of our knowledge, the existence of one-way state generators has no known implications in complexity theory.We show that pseudorandom states compressing bits to qubits can be used to build one-way state generators and pseudorandom states compressing bits to qubits are one-way state generators. This is a nearly optimal result since pseudorandom states with fewer than -qubit output can be shown to exist unconditionally. We also show that any one-way state generator can be broken by a quantum algorithm with classical access to a oracle.An interesting implication of our results is that a -copy one-way state generator exists unconditionally, for every . This contrasts nicely with the previously known fact that -copy one-way state generators require computational hardness. We also outline a new route towards a black-box separation between one-way state generators and quantum bit commitments.
more »
« less
- Award ID(s):
- 2016245
- PAR ID:
- 10589815
- Publisher / Repository:
- Quantum
- Date Published:
- Journal Name:
- Quantum
- Volume:
- 9
- ISSN:
- 2521-327X
- Page Range / eLocation ID:
- 1679
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We report on spectroscopic measurements on the transition in neutral europium-151 and europium-153 at 459.4 nm. The center of gravity frequencies for the 151 and 153 isotopes, reported for the first time in this paper, to our knowledge, were found to be 652,389,757.16(34) MHz and 652,386,593.2(5) MHz, respectively. The hyperfine coefficients for the state were found to be , and , , which all agree with previously published results except for A(153), which shows a small discrepancy. The isotope shift is found to be 3163.8(6) MHz, which also has a discrepancy with previously published results.more » « less
-
We demonstrate a Bell state analyzer that operates directly on frequency mismatch. Based on electro-optic modulators and Fourier-transform pulse shapers, our quantum frequency processor design implements interleaved Hadamard gates in discrete frequency modes. Experimental tests on entangled-photon inputs reveal fidelities of for discriminating between the and frequency-bin Bell states. Our approach resolves the tension between wavelength-multiplexed state transport and high-fidelity Bell state measurements, which typically require spectral indistinguishability.more » « less
-
We consider minimizing harmonic maps from into a closed Riemannian manifold and prove: 1. an extension to of Almgren and Lieb’s linear law. That is, if the fundamental group of the target manifold is finite, we have\[ \]2. an extension of Hardt and Lin’s stability theorem. Namely, assuming that the target manifold is we obtain that the singular set of is stable under small -perturbations of the boundary data. In dimension both results are shown to hold with weaker hypotheses, i.e., only assuming that the trace of our map lies in the fractional space with and satisfying . We also discuss sharpness.more » « less
-
We formulate and prove a Conner–Floyd isomorphism for the algebraic K-theory of arbitrary qcqs derived schemes. To that end, we study a stable -category of non- -invariant motivic spectra, which turns out to be equivalent to the -category of fundamental motivic spectra satisfying elementary blowup excision, previously introduced by the first and third authors. We prove that this -category satisfies -homotopy invariance and weighted -homotopy invariance, which we use in place of -homotopy invariance to obtain analogues of several key results from -homotopy theory. These allow us in particular to define a universal oriented motivic -ring spectrum . We then prove that the algebraic K-theory of a qcqs derived scheme can be recovered from its -cohomology via a Conner–Floyd isomorphism\[ \]where is the Lazard ring and . Finally, we prove a Snaith theorem for the periodized version of .more » « less
An official website of the United States government
