Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0104030 · Physical Review A

Efficient scheme for initializing a quantum register with an arbitrary superposed state

Gui‐Lu Long, Yang Sun

Published Jun 8, 2001• 137 citations
arXivHTMLPDF

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}\ensuremath{\cdots}{i}_{n}〉$ with ${i}_{j}$ 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(Nn}^{2})$ standard 1- and 2-bit gate operations, without introducing additional quantum bits. Application of the scheme in some special cases is discussed.

DOI
10.1103/physreva.64.014303

Related papers

EFFICIENT ALGORITHM FOR INITIALIZING AMPLITUDE DISTRIBUTION OF A QUANTUM REGISTER

M. Andrecut, Mazhar Ali

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.

Modern Physics Letters B•Nov 20, 2001•4 citations

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of $2$. It also reduces the total number of cnot gates from ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from $11$ cnot gates to $9$ and the depth from $11$ to $5$ steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations

Optimal manipulations with qubits: Universal-NOT gate

Vladimír Bužek, Mark S. Hillery, Reinhard F. Werner

Quantum information processing is usually associated with a specific computational basis. Nevertheless, for a deeper understanding of the fundamental principles of quantum computing, it is essential to investigate what is the fidelity of universal operations that are basis independent; i.e., the task is to perform optimally a specific operation on a qubit or a quantum register that is in an unknown state. In this paper we introduce the universal-NOT gate that takes as an input a qubit in an arbitrary state $|\ensuremath{\Psi}〉$ and generates an output that is as close as possible to the orthogonal state $|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉.$

Physical Review A•Oct 1, 1999•233 citations

Efficient state initialization by a quantum spectral filtering algorithm

François Fillion‐Gourdeau, Steve G. MacLean, Raymond Laflamme

An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.

arXiv:1605.02747•Physical Review A•Apr 21, 2017•5 citations

Quantum Information Processing with Low-Dimensional Systems

Alexander Yu. Vlasov

A `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare arbitrary entangled state of these k systems. Preparation and arbitrary transformations of states are possible with universal set of quantum gates and for any d may be suggested such gates acting only on single systems and neighbouring pairs. Here are revisited methods of construction of Hamiltonians for such universal set of gates and as a concrete new example is considered case with qutrits. Quantum tomography is also revisited briefly.

arXiv:quant-ph/0512034•Dec 5, 2005•2 citations

Scheme for Quantum Computing Immune to Decoherence

Colin P. Williams, Farrokh Vatan

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.

•Mar 1, 2008•0 citations
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 ∣i1i2\ensuremath⋯in〉|{i}_{1}{i}_{2}\ensuremath{\cdots}{i}_{n}〉∣i1​i2​\ensuremath⋯in​〉 with ij{i}_{j}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){O(Nn}^{2})O(Nn2) standard 1- and 2-bit gate operations, without introducing additional quantum bits. Application of the scheme in some special cases is discussed.
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.
Quantum information processing is usually associated with a specific computational basis. Nevertheless, for a deeper understanding of the fundamental principles of quantum computing, it is essential to investigate what is the fidelity of universal operations that are basis independent; i.e., the task is to perform optimally a specific operation on a qubit or a quantum register that is in an unknown state. In this paper we introduce the universal-NOT gate that takes as an input a qubit in an arbitrary state $|\ensuremath{\Psi}〉$ and generates an output that is as close as possible to the orthogonal state $|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉.$
An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.
A `register' in quantum information processing -- is composition of k quantum systems, `qudits'. The dimensions of Hilbert spaces for one qudit and whole quantum register are d and d^k respectively, but we should have possibility to prepare arbitrary entangled state of these k systems. Preparation and arbitrary transformations of states are possible with universal set of quantum gates and for any d may be suggested such gates acting only on single systems and neighbouring pairs. Here are revisited methods of construction of Hamiltonians for such universal set of gates and as a concrete new example is considered case with qutrits. Quantum tomography is also revisited briefly.
A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.