The preparation of a quantum register in an arbitrary superposed quantum state is an important operation for quantum computation and quantum information processing. Here, we present an efficient algorithm which requires a polynomial number of elementary operations for initializing the amplitude distribution of a quantum register.
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}\ensuremath{\cdots}{i}_{n}〉$ with ij being either 0 or 1, but it is a nontrivial task to construct an arbitrary superposed quantum state. 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(Nn2) standard 1- and 2-bit gate operations, without introducing additional quantum bits. Application of the scheme in some special cases is discussed.
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector b is encoded in the amplitudes of a quantum state ∣b⟩. However, efficiently preparing ∣b⟩ is known to be a difficult problem because an arbitrary state of Q qubits generally requires approximately 2Q entangling gates, which results in significant decoherence on today's noisy intermediate-scale quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows us to flexibly reduce the quantum resources required for state preparation in an entanglement-efficient manner. Although this comes at the expense of reduced theoretical fidelity, actual fidelities on current NISQ computers might actually be higher due to reduced decoherence. We show this to be true for various cases of interest, such as the normal and log-normal distributions. For low-entanglement states, our algorithm can prepare states with more than an order of magnitude fewer entangling gates as compared with isometric decomposition.
The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the experiments presented, the use of MCMR enables up to a 862.6x reduction in required qubits. Furthermore, the algorithm is provably resistant to both phase-flip and bit-flip errors, leading to a first-of-its-kind empirical demonstration on real quantum hardware, the MCMR-enabled Honeywell System Models H0 and H1-2.
In a previous paper, we described an efficient algorithm to prepare an arbitrary state of a quantum register with arbitrarily high fidelity. Here we present an alternative algorithm that uses a small number of quantum oracles encoding the most significant bits of the absolute value of the complex amplitudes and, similarly, a small number of oracles encoding the most significant bits of the phases. The alternative algorithm is considerably simpler than the one described previously, on the assumption that a sufficient amount of knowledge about the distribution of the absolute values of the complex amplitudes is available.
Abstract Efficient encoding of classical data into quantum state—currently referred to as quantum encoding—holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum encoding entails establishing a classical mapping that correlates machine-recognizable data addresses with qubit indices that are subsequently superposed. Herein, the most imperative lies in casting an algorithm for generating the superposition of any given number of qubit indices. This algorithm is formally known as quantum superposing algorithm. In this work, we present an efficient quantum superposing algorithm, affirming its effectiveness and superior computational performance in a practical quantum encoding scenario. Our theoretical and numerical analyses demonstrate a substantial enhancement in computational efficiency compared to existing algorithms. Notably, our algorithm has a maximum of 2n − 3 controlled-not (CNOT) counts, representing the most optimized result to date.