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/0102100 · Physical Review A

Nonlinear qubit transformations

Lucién Hardy, David D. Song

Published Aug 7, 2001• 8 citations
arXivHTMLPDF

Abstract

We generalize our previous results of universal linear manipulations [Phys. Rev. A 63, 032304 (2001)] to investigate three types of nonlinear qubit transformations using measurement and quantum-based schemes. First, nonlinear rotations are studied. We rotate different parts of a Bloch sphere in opposite directions about the z axis. The second transformation is a map that sends a qubit to its orthogonal state. We consider the case in which the orthogonal state is applied to only a partial area of a Bloch sphere. We also study nonlinear general transformation, i.e., $(\ensuremath{\vartheta},\ensuremath{\varphi})\ensuremath{\rightarrow}(\ensuremath{\vartheta}\ensuremath{-}\ensuremath{\alpha},\ensuremath{\varphi}),$ again applied only to part of the Bloch sphere. In order to achieve these three operations, we consider different measurement preparations and derive the optimal average (instead of universal) quantum unitary transformations. We also introduce a simple method for a qubit measurement and its application to other cases.

DOI
10.1103/physreva.64.032301

Related papers

Crazy Qubit Transformations

Lucién Hardy, David Song

We generalise our previous results of universal linear manipulations [Phys. Rev. A63, 032304 (2001)] to investigate three types of nonlinear qubit transformations using measurement and quantum based schemes. Firstly, nonlinear rotations are studied. We rotate different parts of a Bloch sphere in opposite directions about the z-axis. The second transformation is a map which sends a qubit to its orthogonal state (which we define as ORTHOG). We consider the case when the ORTHOG is applied to only a partial area of a Bloch sphere. We also study nonlinear general transformation, i.e. (theta,phi)->(theta-alpha,phi), again, applied only to part of the Bloch sphere. In order to achieve these three operations, we consider different measurement preparations and derive the optimal average (instead of universal) quantum unitary transformations. We also introduce a simple method for a qubit measurement and its application to other cases.

•Feb 20, 2001•0 citations

HADAMARD TYPE OPERATIONS FOR QUBITS

Arpita Maitra, Preeti Parashar

We obtain the most general ensemble of qubits for which it is possible to design a universal Hadamard gate. These states, when geometrically represented on the Bloch sphere, give a new trajectory. We further consider some Hadamard "type" operations and find ensembles of states for which such transformations hold. The unequal superposition of a qubit and its orthogonal complement is also investigated.

arXiv:quant-ph/0505068•International Journal of Quantum Information•Aug 1, 2006•14 citations

Quantum Computing and the Bloch Sphere: Mathematical Framework, Single-Qubit Transformations, and Circuit Logic

Chinnaraji Annamalai

Quantum computing leverages fundamental principles of quantum mechanics to perform computations far exceeding classical architectures. At the core of single-qubit quantum state manipulation is the Bloch sphere, a geometric representation mapping the state space of two-level quantum systems onto a three-dimensional unit sphere. This paper presents a comprehensive theoretical framework of qubits, starting from single-qubit geometric state vectors and expanding to rigorous multi-qubit mathematical formulations. Furthermore, it analyzes single-qubit quantum gates as unitary rotations on the Bloch sphere, evaluates multi-qubit system scaling, and explicitly proves state normalization conditions using Born's rule across multi-dimensional Hilbert spaces.

•Sep 14, 2026•4 citations

Quantum state matching of qubits via measurement-induced nonlinear transformations

Orsolya Kálmán, T. Kiss

We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined with a postselection scheme conditioned on the measurement result obtained on one of the qubits of the pair. The resulting transformation is a deterministic, nonlinear, chaotic map in the Hilbert space. We derive a class of these transformations capable of orthogonalizing nonorthogonal qubit states after a few iterations. These nonlinear maps orthogonalize states which correspond to the two different convergence regions of the nonlinear map. Based on the analysis of the border (the so-called Julia set) between the two regions of convergence, we show that it is always possible to find a map capable of deciding whether an unknown state is within a neighborhood of fixed radius around a desired quantum state. We analyze which one- and two-qubit operations would physically realize the scheme. It is possible to find a single two-qubit unitary gate for each map or, alternatively, a universal special two-qubit gate together with single-qubit gates in order to carry out the task. We note that it is enough to have a single physical realization of the required gates due to the iterative nature of the scheme.

arXiv:1708.03610•Physical Review A•Mar 26, 2018•22 citations

Rapid-state purification protocols for a Cooper pair box

Elias J. Griffith, Charles D. Hill, Jason F. Ralph +2 more

We propose techniques for implementing two different rapid-state purification schemes, within the constraints present in a superconducting charge qubit system. Both schemes use a continuous measurement of charge $(z)$ measurements and seek to minimize the time required to purify the conditional state. Our methods are designed to make the purification process relatively insensitive to rotations about the $x$-axis, due to the Josephson tunneling Hamiltonian. The first proposed method, based on the scheme of Jacobs [Phys. Rev. A 67, 030301(R) (2003)] uses the measurement results to control bias $(z)$ pulses so as to rotate the Bloch vector onto the $x$-axis of the Bloch sphere. The second proposed method, based on the scheme of Wiseman and Ralph [New J. Phys. 8, 90 (2006)] uses a simple feedback protocol which tightly rotates the Bloch vector about an axis almost parallel with the measurement axis. We compare the performance of these and other techniques by a number of different measures.

arXiv:quant-ph/0610044•Physical Review B•Jan 9, 2007•24 citations

Nonlinear transformations in quantum computation

Zoë Holmes, Nolan J. Coble, Andrew T. Sornborger +1 more

While quantum computers are naturally well suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical postprocessing.

arXiv:2112.12307•Physical Review Research•Feb 13, 2023•51 citations
We generalize our previous results of universal linear manipulations [Phys. Rev. A 63, 032304 (2001)] to investigate three types of nonlinear qubit transformations using measurement and quantum-based schemes. First, nonlinear rotations are studied. We rotate different parts of a Bloch sphere in opposite directions about the z axis. The second transformation is a map that sends a qubit to its orthogonal state. We consider the case in which the orthogonal state is applied to only a partial area of a Bloch sphere. We also study nonlinear general transformation, i.e., (\ensuremathϑ,\ensuremathφ)\ensuremath→(\ensuremathϑ\ensuremath−\ensuremathα,\ensuremathφ),(\ensuremath{\vartheta},\ensuremath{\varphi})\ensuremath{\rightarrow}(\ensuremath{\vartheta}\ensuremath{-}\ensuremath{\alpha},\ensuremath{\varphi}),(\ensuremathϑ,\ensuremathφ)\ensuremath→(\ensuremathϑ\ensuremath−\ensuremathα,\ensuremathφ), again applied only to part of the Bloch sphere. In order to achieve these three operations, we consider different measurement preparations and derive the optimal average (instead of universal) quantum unitary transformations. We also introduce a simple method for a qubit measurement and its application to other cases.
We generalise our previous results of universal linear manipulations [Phys. Rev. A63, 032304 (2001)] to investigate three types of nonlinear qubit transformations using measurement and quantum based schemes. Firstly, nonlinear rotations are studied. We rotate different parts of a Bloch sphere in opposite directions about the z-axis. The second transformation is a map which sends a qubit to its orthogonal state (which we define as ORTHOG). We consider the case when the ORTHOG is applied to only a partial area of a Bloch sphere. We also study nonlinear general transformation, i.e. (theta,phi)->(theta-alpha,phi), again, applied only to part of the Bloch sphere. In order to achieve these three operations, we consider different measurement preparations and derive the optimal average (instead of universal) quantum unitary transformations. We also introduce a simple method for a qubit measurement and its application to other cases.
Quantum computing leverages fundamental principles of quantum mechanics to perform computations far exceeding classical architectures. At the core of single-qubit quantum state manipulation is the Bloch sphere, a geometric representation mapping the state space of two-level quantum systems onto a three-dimensional unit sphere. This paper presents a comprehensive theoretical framework of qubits, starting from single-qubit geometric state vectors and expanding to rigorous multi-qubit mathematical formulations. Furthermore, it analyzes single-qubit quantum gates as unitary rotations on the Bloch sphere, evaluates multi-qubit system scaling, and explicitly proves state normalization conditions using Born's rule across multi-dimensional Hilbert spaces.
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined with a postselection scheme conditioned on the measurement result obtained on one of the qubits of the pair. The resulting transformation is a deterministic, nonlinear, chaotic map in the Hilbert space. We derive a class of these transformations capable of orthogonalizing nonorthogonal qubit states after a few iterations. These nonlinear maps orthogonalize states which correspond to the two different convergence regions of the nonlinear map. Based on the analysis of the border (the so-called Julia set) between the two regions of convergence, we show that it is always possible to find a map capable of deciding whether an unknown state is within a neighborhood of fixed radius around a desired quantum state. We analyze which one- and two-qubit operations would physically realize the scheme. It is possible to find a single two-qubit unitary gate for each map or, alternatively, a universal special two-qubit gate together with single-qubit gates in order to carry out the task. We note that it is enough to have a single physical realization of the required gates due to the iterative nature of the scheme.
We propose techniques for implementing two different rapid-state purification schemes, within the constraints present in a superconducting charge qubit system. Both schemes use a continuous measurement of charge (z)(z)(z) measurements and seek to minimize the time required to purify the conditional state. Our methods are designed to make the purification process relatively insensitive to rotations about the xxx-axis, due to the Josephson tunneling Hamiltonian. The first proposed method, based on the scheme of Jacobs [Phys. Rev. A 67, 030301(R) (2003)] uses the measurement results to control bias (z)(z)(z) pulses so as to rotate the Bloch vector onto the xxx-axis of the Bloch sphere. The second proposed method, based on the scheme of Wiseman and Ralph [New J. Phys. 8, 90 (2006)] uses a simple feedback protocol which tightly rotates the Bloch vector about an axis almost parallel with the measurement axis. We compare the performance of these and other techniques by a number of different measures.
While quantum computers are naturally well suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop a series of basic subroutines for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical postprocessing.