Quantum state preparation protocol for encoding classical data into the amplitudes of a quantum information processing register's wave function

• URL: http://arxiv.org/abs/2107.14127v2
• Date: Fri, 4 Feb 2022 06:49:19 GMT
• Title: Quantum state preparation protocol for encoding classical data into the amplitudes of a quantum information processing register's wave function
• Authors: Sahel Ashhab
• Abstract summary: We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition. The protocol combines partial CNOT gate rotations with probabilistic projection onto the desired state.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning algorithms applied to classical data. The protocol combines partial CNOT gate rotations with probabilistic projection onto the desired state. The number of additional ancilla qubits used during the implementation of the protocol, as well as the number of quantum gates, scale linearly with the number of qubits in the processing register and hence logarithmically with $N$. The average time needed to successfully perform the encoding scales logarithmically with the number of qubits, in addition to being inversely proportional to the acceptable error in the encoded amplitudes. It also depends on the structure of the data set in such a way that the protocol is most efficient for non-sparse data.

Related papers

• Efficient implementation of single particle Hamiltonians in exponentially reduced qubit space [0.0]
  Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements.<n>We introduce a logarithmic-qubit encoding that maps a system with $N$ physical sites onto only $lceil log N rceil$ qubits.<n>Within this reduced register, we construct a compatible variational circuit and a Gray-code-inspired measurement strategy.
  arXiv  Detail & Related papers  (2026-01-01T07:43:31Z)
• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• Sublinear Classical-to-Quantum Data Encoding using $n$-Toffoli Gates [3.0711566483997066]
  A common strategy is amplitude encoding, which embeds a classical input vector of size N=2textsuperscriptn in the amplitudes of an n-qubit register.<n>We propose a general-purpose procedure with sublinear average depth in N, increasing the window of utility.<n>Our amplitude encoding method encodes arbitrary complex vectors of size N=2textsuperscriptn at any desired binary precision using a register with n qubits plus 2 ancillas and a sublinear number of multi-controlled NOT (MCX) gates.
  arXiv  Detail & Related papers  (2025-05-09T13:49:16Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Efficient Quantum Simulation of Electron-Phonon Systems by Variational Basis State Encoder [12.497706003633391]
  Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states. We propose a variational basis state encoding algorithm that reduces the scaling of the number of qubits and quantum gates.
  arXiv  Detail & Related papers  (2023-01-04T04:23:53Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Compact quantum kernel-based binary classifier [2.0684234025249717]
  We present the simplest quantum circuit for constructing a kernel-based binary classifier. The number of qubits is reduced by two and the number of steps is reduced linearly. Our design also provides a straightforward way to handle an imbalanced data set.
  arXiv  Detail & Related papers  (2022-02-04T14:30:53Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Recycling qubits in near-term quantum computers [1.2891210250935146]
  We propose a protocol that can unitarily reset qubits when the circuit has a common convolutional form. This protocol generates fresh qubits from used ones by partially applying the time-reversed quantum circuit over qubits that are no longer in use.
  arXiv  Detail & Related papers  (2020-12-03T03:24:50Z)
• All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits [0.0]
  Quantum repeaters are a promising platform for realizing long-distance quantum communication. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill qubits.
  arXiv  Detail & Related papers  (2020-11-30T15:14:34Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Programming a quantum computer with quantum instructions [39.994876450026865]
  We use a density matrixiation protocol to execute quantum instructions on quantum data. A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
  arXiv  Detail & Related papers  (2020-01-23T22:43:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.