Designing a quantum circuit that prepares userspecific states is a fundamental task in quantum computation. This involves loading user-provided data into the initial superposition state of a quantum register, enabling further processing by quantum algorithms. To address this state preparation problem, a quantum circuit utilizing rotation Y gates and controlled rotation Y gates has been previously proposed. However, the method for determining the rotation angles of these Y gates has not been detailed. This paper introduces a closed-form method for computing these angle parameters based on user-provided data. Numerical examples demonstrate the ease of use of the proposed method, which is implemented using IBM’s quantum information software kit (Qiskit). Additionally, real-world feature data from iris flowers is used to show that the feature data can be accurately loaded into the quantum register, facilitating tasks such as machine learning, dimensionality reduction, or pattern recognition through quantum computation.
Designing a quantum circuit that prepares userspecific states is a fundamental task in quantum computation. This involves loading user-provided data into the initial superposition state of a quantum register, enabling further processing by quantum algorithms. To address this state preparation problem, a quantum circuit utilizing rotation Y gates and controlled rotation Y gates has been previously proposed. However, the method for determining the rotation angles of these Y gates has not been detailed. This paper introduces a closed-form method for computing these angle parameters based on user-provided data. Numerical examples demonstrate the ease of use of the proposed method, which is implemented using IBM’s quantum information software kit (Qiskit). Additionally, real-world feature data from iris flowers is used to show that the feature data can be accurately loaded into the quantum register, facilitating tasks such as machine learning, dimensionality reduction, or pattern recognition through quantum computation.
Digital finite-impulse-response (FIR) filters are a cornerstone of digital signal processing (DSP) and modern communication systems, making their implementation via quantum computation a compelling area of study. Although recent methods have used orthogonal triangular decomposition (OTD) to realize FIR filters through quantum elementary gates, these approaches rely heavily on matrix QR decomposition and IBM Qiskit's transpilation tools, resulting in significant computational overhead. To address these inefficiencies, this paper proposes a new implementation using quantum state preparation (QSP) circuits. By employing only rotation y gate and multi-controlled rotation y gates, the proposed method determines circuit parameters through closed-form solutions derived directly from the input signal and filter coefficient vectors. Experimental results for a digital mean filter demonstrate the effectiveness of this QSP-based approach, showing the reduced implementation complexity compared to the conventional OTD method.
This article presents a new approach to the problem of transforming one quantum state into another. It is shown that an r-qubit superposition |x⟩ can be obtained from another r-qubit superposition |y⟩, by using only (2r−1) rotations, each presented by one controlled rotation gate. The quantum superpositions with real amplitudes are considered. The traditional two-stage approach Uy−1Ux:|x⟩→|0⟩⊕r→|y⟩ requires twice as many rotations. Here, both transformations to the conventual basis state, Ux: |x⟩→ |0⟩⊕r and Uy: |y⟩→ |0⟩⊕r, use (2r−1) rotations each on two binary planes, and many of these rotations require additional sets of CNOTs to be represented as 1- or 2-qubit-controlled gates. The proposed method is based on the concept of the discrete signal-induced heap transform (DsiHT) which is unitary and generated by a vector and a set of angular equations with given parameters. The quantum analog of this transform is described. The main characteristic of the DsiHT is the path of processing the data. It is shown that there exist such fast paths that allow for effective computing of the DsiHT, which leads to the simple quantum circuits for state preparation and transformation. Examples of such paths are given and quantum circuits for preparation and transformation of 2-, 3-, and 4-qubits are described in detail. CNOT gates are not used, but only controlled gates of elementary rotations around the y-axis. It is shown that the transformation and, in particular, only rotation gates with control qubits are required for initialization of 2-, 3-, and 4-qubits. The quantum circuits are simple and have a recursive form, which makes them easy to implement for arbitrary r-qubit superposition, with r≥2. This approach significantly reduces the complexity of quantum state transformations, paving the way for more efficient quantum algorithms and practical implementations on near-term quantum devices.
Quantum state preparation (QSP) refers to the process of initializing a quantum circuit into a specific quantum state, which serves as the starting point for several quantum algorithms. In this article, a Gram-Schmidt decomposition (GSD) method is proposed to address the QSP problem. The method involves the following five steps: First, the first column vector of the identity matrix is replaced with the unit-norm data vector to construct an initial matrix. Second, the initial matrix is decomposed into the product of a unitary matrix and an upper triangular matrix using the GSD method. Third, the transpile tool from IBM Qiskit is employed to design a quantum circuit, ensuring that the input and output state vectors correspond to the relationship defined by the obtained unitary matrix. Fourth, when the input state vector of the quantum circuit is set as the zero vector, the output state vector corresponds to the desired data vector to be prepared. Finally, a numerical example using the Iris flower dataset is provided to demonstrate the effectiveness of the proposed method.
Quantum state preparation is the process of producing a target quantum state that will be used as the input to a quantum circuit. Many quantum algorithms require an input state where amplitudes, phases, or basis probabilities encode problem data, and the cost of preparing this state can be significant in gate count and circuit depth. This review summarizes common goals, assumptions, and methods for quantum state preparation, with emphasis on preparing states from classical vectors, probability distributions, and feature data used in quantum machine learning. We organize approaches by the information they load and by the resources they require, including gate count, circuit depth, qubit overhead, and classical preprocessing. It also compares exact and approximate preparation procedures, and discusses how precision targets affect cost. The review highlights links between families of methods, typical sources of resource estimates, and criteria that help match a preparation method to a task and hardware constraints.
Abstract Quantum state preparation circuits for loading classical data into quantum computers significantly influence the performance and complexity of variational quantum algorithms within hybrid quantum-classical systems. Since real-world data is often high-dimensional and mapping it to a quantum state is costly and non-trivial, it is transformed on classical computers to overcome limitations regarding quantum register size and circuit complexity. We present a data transformation method using Bloom filters to represent classical data for quantum state preparation circuits. Further, the paper illustrates that tiny fragments of this classical data encoding can be used for quantum machine learning to make an ensemble of the resulting quantum models surprisingly powerful. Due to the representation of the transformed data as a fragmented bit array, the quantum state preparation circuit only relies on a single rotational gate per qubit and small quantum registers. We demonstrate our approach and its representation power in a series of simulations. The simulations indicate that the randomized transformation provides diversity for ensemble models and that even small bit arrays with high error rates in data representation are sufficient for binary classification tasks.
A possible approach to tackling computationally demanding issues beyond the capabilities of conventional algorithms is the use of quantum circuits, which provide a fundamental foundation for utilizing the power of quantum computation. This abstract examines how quantum circuits are implemented, emphasizing important topics such as circuit optimization, gate operations, and qubit manipulation. We explore different methods of encoding quantum information into topological qubits, trapped ions, and superconducting circuits, among other physical qubit formats. Furthermore, we go over the function of gate operations in quantum circuits, emphasizing crucial gates like phase, Hadamard, and CNOT gates, which serve as the foundation for quantum algorithms. Additionally, we look at methods for maximizing the efficiency and dependability of quantum processing by designing quantum circuits to minimize gate counts, depth, and error rates. To enhance the capabilities of quantum computing, this abstract presents a novel synthesis of quantum neural networks (QNNs) and quantum parameterized circuits. Through the use of parameterized quantum circuits' inherent flexibility, our approach makes it easier to design and optimize quantum circuits with flexible parameters, providing a flexible foundation for a variety of quantum algorithms. Using this amalgamation, we unleash the capacity of quantum computers to address intricate optimization and machine learning assignments with unparalleled effectiveness and expandability. Our solution bridges the gap between traditional machine learning approaches and quantum computing paradigms by enabling the smooth integration of classical data processing techniques with quantum computation. We use quantum states as data representations in our implementation of quantum neural networks, and we optimize trainable parameters to meet predetermined goals. This new paradigm opens up the investigation of the inherent features of quantum states and provides new perspectives on their processing power compared to their classical counterparts. We show, by thorough testing and analysis, how effective quantum parameterized circuits and QNNs are at solving practical problems in a variety of fields. Our work sets the ground for revolutionary breakthroughs in quantum information processing by pushing the boundaries of quantum computation and machine learning integration, offering hitherto unseen insights and solutions to challenging challenges in science, engineering, and beyond.