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

Journal of Quantum Information Science

Formalized Operators with Phase Encoding

Nikolay Raychev

Published Jan 1, 2015• 4 citations
Publisher

Abstract

In this article the concept of phase encoding/decoding is used to analyze and formalize a simple quantum algorithm—the Deutsch’s algorithm. The algorithm is formalized in two different ways through an analysis, based on phase encoding/decoding, carried out by the formalized elementary operators developed by the author of this article. Concrete examples of different possible realizations of the formalized with Raychev’s operators Deutsch’s algorithms are offered.

DOI
10.4236/jqis.2015.53014

Related papers

Controlled formalized operators

Nikolay Raychev

In this report is considered the generalization of the principles, which manage the formalization of controlled qubit operators. The research builds on the standard external data sources, for development of a generalized system for conditional operators. Certain controlled operators are viewed as linear combinations of universal operators. This system provides a generalized scheme for the type of the controlled operators, which could be encountered in a circuit, composed entirely of elementary operators. In this report is presented a formalized generalization of single qubit and controlled operators, based on formalized single qubit operator. This work is part of the developed by the author formalized system for designing of algorithmic models for quantum circuits, based on phase encoding, decod- ing and parameterization of primitive quantum operators. In previous publications of the author (6, 7, 8) were defined sev- eral sets of operators on the n qubit, which generalize certain classical characteristics: identity and logical negation. Moreo- ver, some ways were explored in which can be constructed operators as linear combinations of elements from those sets. Such combinations capture the partial application of an opera- tor together with another operator, which in a broader sense is its logical negation.

International Journal of Scientific and Engineering Research•May 25, 2015•4 citations

Classical realization of the quantum Deutsch algorithm

Yohan Vianna de Almeida, Mariana R. Barros, Malena O. Hor-Meyll

In the rapidly growing area of quantum information, the Deutsch algorithm is ubiquitous and, in most cases, the first one to be introduced to any student of this relatively new field of research. The reason for this historical relevance stems from the fact that, although extremely simple, the algorithm conveys all the main features of more complex quantum computations. In spite of its simplicity, the uncountable experimental realizations of the algorithm in a broad variety of physical systems are in general quite involved. The aim of this work is two-fold: to introduce the basic concepts of quantum computation for readers with just a minimum knowledge of quantum mechanics and to present a novel and entirely accessible implementation of a classical analogue of the quantum Deutsch algorithm. By employing only elementary optical devices, such as lenses and diode lasers, this experimental realization has a striking advantage over all previous implementations: it can easily be understood and reproduced in most basic undergraduate or even high-level school laboratories.

arXiv:1903.06655•American Journal of Physics•Nov 20, 2018•7 citations

Elementary quantum algorithms

Jonathan A. Jones, Dieter Jaksch

Although the basic ideas of quantum computation are fairly straightforward, the detailed manipulations required to extract a useful result from an entangled superposition of answers can be rather complicated. There are, however, a small number of algorithms which are simple enough to explain using only elementary methods. The best example is Deutsch's algorithm: as this only requires two qubits its properties are amenable to brute-force matrix calculations, and these calculations can be simplified using a variety of short cuts, which also give some insight into how and why the algorithm works. We will also explore the simplest case of Grover's quantum search algorithm, which is once again simple enough to be tacked by brute force. Finally we will look briefly at two methods used to stabilize quantum computers against errors. Deutsch's algorithm The invention of Deutsch's algorithm can be taken as defining the start of modern quantum computation, and it remains a key example, exhibiting many of the key properties of quantum algorithms in a particularly simple form. (Note, however, that the version of Deutsch's algorithm described here is not in fact the original but a later modification which is both more powerful and easier to understand.) Consider a binary function f from one bit to one bit, that is a function which takes in either 0 or 1 as its input and returns either 0 or 1 as its output. There are four such functions which may be conveniently labeled by their outputs as shown in Table 8.1.

Cambridge University Press eBooks•Jul 19, 2012•0 citations

Description and error analysis of quantum alghorithms in the projection evolution model -- the Deutsch algorithm case

Krzysztof Lider, Marek Góźdź

This work demonstrates that the Deutsch algorithm can be effectively modelled using a two-level harmonic oscillator within the second quantization formalism. By adopting this framework, evolution operators are derived. We present a projection evolution model that accurately characterizes the physical state transformation within quantum gates. This approach provides a systematic method for finding evolution operators, enabling the complete description and prediction of state evolution - including projection errors - in quantum algorithms.

quant-pharXiv:2605.02293•May 5, 2026•0 citations

Quantum algorithms in one-way quantum computation

Giuseppe Vallone, F. De Martini, Paolo Mataloni

Cluster states are the fundamental resource for the one-way model of quantum computation. In this paper we show the realization of a two-photon four-qubit cluster state. The qubits are encoded in the polarization and the linear momentum of the particles. By using this state we realized two important quantum algorithms, namely the Grover’s search and the Deutsch’s algorithm.

Optics and Spectroscopy•Feb 1, 2010•0 citations

Conjugated operators in quantum algorithms

Peter Høyer

This paper addresses the question of understanding quantum algorithms in terms of unitary operators. Many quantum algorithms can be expressed as applications of operators formed by conjugating so-called classical operators. The operators that are used for conjugation are determined by the problem and any additional structure possessed by the Hilbert space that is acted upon. We prove many commutative laws for these different operators, and we use those to phrase and analyze old and new problems and algorithms. As an example, we review the Abelian subgroup problem. We then introduce the problem of determining a group homomorphism, and we give classical and quantum algorithms for it. We also generalize Deutsch's problem and improve the previous best algorithms for earlier generalizations of it.

Physical Review A•May 1, 1999•34 citations
In this article the concept of phase encoding/decoding is used to analyze and formalize a simple quantum algorithm—the Deutsch’s algorithm. The algorithm is formalized in two different ways through an analysis, based on phase encoding/decoding, carried out by the formalized elementary operators developed by the author of this article. Concrete examples of different possible realizations of the formalized with Raychev’s operators Deutsch’s algorithms are offered.
In this report is considered the generalization of the principles, which manage the formalization of controlled qubit operators. The research builds on the standard external data sources, for development of a generalized system for conditional operators. Certain controlled operators are viewed as linear combinations of universal operators. This system provides a generalized scheme for the type of the controlled operators, which could be encountered in a circuit, composed entirely of elementary operators. In this report is presented a formalized generalization of single qubit and controlled operators, based on formalized single qubit operator. This work is part of the developed by the author formalized system for designing of algorithmic models for quantum circuits, based on phase encoding, decod- ing and parameterization of primitive quantum operators. In previous publications of the author (6, 7, 8) were defined sev- eral sets of operators on the n qubit, which generalize certain classical characteristics: identity and logical negation. Moreo- ver, some ways were explored in which can be constructed operators as linear combinations of elements from those sets. Such combinations capture the partial application of an opera- tor together with another operator, which in a broader sense is its logical negation.
In the rapidly growing area of quantum information, the Deutsch algorithm is ubiquitous and, in most cases, the first one to be introduced to any student of this relatively new field of research. The reason for this historical relevance stems from the fact that, although extremely simple, the algorithm conveys all the main features of more complex quantum computations. In spite of its simplicity, the uncountable experimental realizations of the algorithm in a broad variety of physical systems are in general quite involved. The aim of this work is two-fold: to introduce the basic concepts of quantum computation for readers with just a minimum knowledge of quantum mechanics and to present a novel and entirely accessible implementation of a classical analogue of the quantum Deutsch algorithm. By employing only elementary optical devices, such as lenses and diode lasers, this experimental realization has a striking advantage over all previous implementations: it can easily be understood and reproduced in most basic undergraduate or even high-level school laboratories.
Although the basic ideas of quantum computation are fairly straightforward, the detailed manipulations required to extract a useful result from an entangled superposition of answers can be rather complicated. There are, however, a small number of algorithms which are simple enough to explain using only elementary methods. The best example is Deutsch's algorithm: as this only requires two qubits its properties are amenable to brute-force matrix calculations, and these calculations can be simplified using a variety of short cuts, which also give some insight into how and why the algorithm works. We will also explore the simplest case of Grover's quantum search algorithm, which is once again simple enough to be tacked by brute force. Finally we will look briefly at two methods used to stabilize quantum computers against errors. Deutsch's algorithm The invention of Deutsch's algorithm can be taken as defining the start of modern quantum computation, and it remains a key example, exhibiting many of the key properties of quantum algorithms in a particularly simple form. (Note, however, that the version of Deutsch's algorithm described here is not in fact the original but a later modification which is both more powerful and easier to understand.) Consider a binary function f from one bit to one bit, that is a function which takes in either 0 or 1 as its input and returns either 0 or 1 as its output. There are four such functions which may be conveniently labeled by their outputs as shown in Table 8.1.
This work demonstrates that the Deutsch algorithm can be effectively modelled using a two-level harmonic oscillator within the second quantization formalism. By adopting this framework, evolution operators are derived. We present a projection evolution model that accurately characterizes the physical state transformation within quantum gates. This approach provides a systematic method for finding evolution operators, enabling the complete description and prediction of state evolution - including projection errors - in quantum algorithms.
This paper addresses the question of understanding quantum algorithms in terms of unitary operators. Many quantum algorithms can be expressed as applications of operators formed by conjugating so-called classical operators. The operators that are used for conjugation are determined by the problem and any additional structure possessed by the Hilbert space that is acted upon. We prove many commutative laws for these different operators, and we use those to phrase and analyze old and new problems and algorithms. As an example, we review the Abelian subgroup problem. We then introduce the problem of determining a group homomorphism, and we give classical and quantum algorithms for it. We also generalize Deutsch's problem and improve the previous best algorithms for earlier generalizations of it.