Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State

Abstract

Preparation of a quantum register is an important step in quantum computation and quantum information processing. It is straightforward to build a simple quantum state such as $|i_1 i_2 ... i_n\ket$ with $i_j$ being either 0 or 1, but is a non-trivial task to construct an {\it arbitrary} superposed quantum state. In this Paper, we present a scheme that can most generally initialize a quantum register with an arbitrary superposition of basis states. Implementation of this scheme requires $O(N{n}^2)$ standard 1- and 2-bit gate operations, {\it without introducing additional quantum bits}. Application of the scheme in some special cases is discussed.

4 pages, 4 figures, accepted by Phys. Rev. A

Cited by in corpus (40)

• The quest for a Quantum Neural Network
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Circuit-Based Quantum Random Access Memory for Classical Data
• Efficient quantum algorithms for $GHZ$ and $W$ states, and implementation on the IBM quantum computer
• Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicator
• Geometric transformations of multidimensional color images based on NASS
• Classical-to-quantum convolutional neural network transfer learning
• The theory of the quantum kernel-based binary classifier
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
• Circuit-based quantum random access memory for classical data with continuous amplitudes
• Configurable sublinear circuits for quantum state preparation
• Double sparse quantum state preparation
• Non-IID Quantum Federated Learning with One-shot Communication Complexity
• Finite-temperature topological phase transitions of spin-$j$ systems in Uhlmann processes: General formalism and experimental protocols
• Modularization of multi-qubit controlled phase gate and its NMR implementation
• Approximate encoding of quantum states using shallow circuits
• Circuit complexity of quantum access models for encoding classical data
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Entanglement-based quantum deep learning
• Quantum algorithms for scientific computing
• Quantum algorithms for the generalized eigenvalue problem
• Reinforcement Learning with Quantum Variational Circuits
• Parallel quantum trajectories via forking for sampling without redundancy
• Benchmarking universal quantum gates via channel spectrum
• Distributed Quantum Machine Learning
• Upper Bounds for the Number of Quantum Clones under Decoherence
• Quantum vs. classical algorithms for solving the heat equation
• Quantum Generative Adversarial Networks in a Silicon Photonic Chip with Maximum Expressibility
• A full circuit-based quantum algorithm for excited-states in quantum chemistry
• Quantum smoothed particle hydrodynamics algorithm inspired by quantum walks
• Quantum encoder for fixed Hamming-weight subspaces
• Initial-state-dependent quantum speed limit for dissipative state preparation: Framework and optimization
• Braiding fractional quantum Hall quasiholes on a superconducting quantum processor
• Quantum Multiplexer Simplification for State Preparation
• Switchable Particle Statistics with an Embedding Quantum Simulator
• Tensor-Programmable Quantum Circuits for Solving Differential Equations
• Optimal Control of One-Qubit Gates
• A scalable tripartite Wigner's friend scenario
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms
• Robust and optimal loading of general classical data into quantum computers