<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Research on the Increase of Information Theory in the Era of the Ending of Silicon Electronics and New Types of Risks</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Volodymyr</forename><surname>Hrytsyk</surname></persName>
							<email>volodymyr.v.hrytsyk@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>12, Stepan Bandera str</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Mariia</forename><surname>Nazarkevych</surname></persName>
							<email>mariia.a.nazarkevych@lpnu.ua</email>
							<affiliation key="aff0">
								<orgName type="institution">Lviv Polytechnic National University</orgName>
								<address>
									<addrLine>12, Stepan Bandera str</addrLine>
									<postCode>79013</postCode>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Research on the Increase of Information Theory in the Era of the Ending of Silicon Electronics and New Types of Risks</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">EF7F258BB02E532E46A8FD1DC22204F3</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-19T16:26+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>risks</term>
					<term>quantum information</term>
					<term>supersymmetry</term>
					<term>muon (M.Nazarkevych) ORCID: 0000-0002-9696-5805 (V.Hrytsyk); 0000-0002-6528-9867 (M.Nazarkevych)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Today, it is obvious that the era of silicon electronics is nearing completion, and nanotechnologies are being replaced by quantum technologies that operate on ions, atoms and elementary particles. This means that the rules for building computers will change: information theory will need to be adapted: the laws that describe the rules of behavior in the quantum world will have to be taken into account. One of the most probable scenarios of information theory development is investigated. The paper focuses on understanding "elementary" objects, operations, and simple systems of quantum information theory to study their properties. That is, for a promising generation it is necessary to develop conceptual models of work for conditions where the classical rules of physics and computer science will not be fulfilled by virtue of other laws of physics that affect monoatomic processors. In particular, one of the conditions affecting a monoatomic carrier is the condition of "Schrödinger cat"the storage cell is simultaneously in the states of zero and one. This condition requires the development of specific protocols for data processing and transmission and reproduction; that is, a significant correction in the laws of information theory is required. To do this, the author reviews the problem and formulates the problem to be solved. Any material object or process is the primary source of information. All its possible states constitute the source code of information.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>The discovery of the last decade has made it possible to implement fully automated adaptive cybernetic systems for their direct interaction with humans. Computer vision works as an element of perception of the external environment. People began to understand the basics of the processes taking place in the brain and already implemented implants (artificial arms, legs, eyes, toys, etc.). The U.S. Department of State's automated identification system processes more than seven hundred and five million photos a year. We live in the era of the next round of cybernetic technologies -the era of the Industrial Revolution 4.0 <ref type="bibr" target="#b0">[1]</ref>. The dynamics of the emergence of new concepts, methods and relevant opportunities (theoretical, applied developments) <ref type="bibr" target="#b1">[2]</ref> is rapidly moving to the moment where society reaches a point where the laws that have served as a support for science can no longer describe the rules of cybernetic systems, and the ability to reliably predict the flow of information in 15-20 years is impossible to predict today. This will happen because the principles of information dissemination can be based on fundamentally new models <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>, which we do not use today. Moreover, although such an assumption for people, who want to fall into the field of adaptive IT research, seems a bit premature, but the worst-case scenario is that this is the only possible model of development. In this paper, the authors explores one of the most likely scenarios for the development of information theory.</p><p>Today there is a clear structure of definitions of concepts used in information technology, i.e. information, messages, signal, data, entropy -these are different concepts that have a clearly defined place in information theory. In the theory of information, information is considered as a quantitative measure to eliminate uncertainty, which decreases as a result of obtaining some information.</p><p>Let us introduce several definitions: Information is new knowledge that the consumer receives as a result of the perception of certain messages.</p><p>Knowledge is a set of data (from an individual, society or artificial intelligence system) about the world, including data on the properties of objects, patterns of processes and phenomena, as well as the rules of using this information for decision-making. In other words, knowledge is a reflection of reality (objects, situations) in the form of concepts, relationships (subjective image of objective reality).</p><p>Subject knowledge is the ability to solve problems independently in the subject area, i.e. to use the available data to achieve the goal.</p><p>Data is a message recorded on a specific medium and presented in a form convenient for receiving, transmitting, processing information-analytic system (human or device).</p><p>A message is a sequence of signs, signals or physical processes that change over time, i.e. those that have a material and energy basis.</p><p>The theory of information is based on the method proposed by K. Shannon for calculating the amount of information that contains one random variable relative to another random variable. The amount of information in a message is determined by how much uncertainty is reduced after receiving the message. From this point of view, the amount of information contained in the received message is the greater, the greater the uncertainty before the transmission of the message.</p><p>If the state of an object or system is known in advance, then the message about this state does not carry any information for its recipient. If we receive new information about the state/condition of the observed object, then this message carries new information that will increase knowledge about the object. In this case, it is said that such a message contains some information for its recipient.</p><p>Thus, in the first approximation, information can be defined as new, previously unknown knowledge about the state of an object or system, and the amount of information is the amount of this knowledge. It is clear that if new knowledge increases the general level of knowledge about the state of the observed object, the amount of information accumulates and has an additive nature.</p><p>As a result, before the source sends a message to its recipient, there is uncertainty about the content of the message about the state of the object of observation. After selecting a message, the source generates a certain amount of information, which reduces this uncertainty.</p><p>The theory of information is based on the method proposed by Claude Shannon to measure the amount of information contained in one random variable relative to another random variable <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b34">35]</ref>. This method allows you to express the amount of information in numbers and provides an opportunity to objectively assess the information contained in the report.</p><p>Consider the basic calculations of Shannon's probabilistic approach to determining the amount of information.</p><p>Let a discrete source of information output a sequence of messages xi, each of which is selected from the alphabet X={x1, x2, … xi …, xk}, where k is the capacity of the source alphabet. Each elementary message for its recipient contains information as a set of information about the state of an object or system.</p><p>In order to abstract from the specific content of information, i.e. its semantic meaning, and to obtain the most general definition of the amount of information, the quantitative measure of information is determined without taking into account its semantic content, as well as value and usefulness for the recipient.</p><p>Before the connection takes place, there is uncertainty as to which of the possible messages will be transmitted. The degree of uncertainty in the transmission of the message хi can be determined by its a priori probability pi. Therefore, the amount of information containing one average message I(Xi) will be some function of pi: I(Xi)=f(pi). You mean the type of this function.</p><p>Let the measure of the amount of information I(Xi) correspond to two properties:</p><p>1) if the choice of the source message xi is known in advance (there is no uncertainty), ie we have a reliable case, the probability of which is pi=1, then I(Xi)=f(1)= 0;</p><p>2) if the source sequentially issues messages xi and xj, and the probability of such a choice pij is a compatible probability of events xi and xj, then the amount of information in these elementary messages is equal to the sum of the amount of information in each of them.</p><p>The probability of the joint loss of two random events xi and xj is equal to the product of the probability of one of these events and the probability of the other, provided that the first event occurred, another words pij=pi⋅pj/i=P⋅Q.</p><p>Then, from property 2 of the amount of information, it follows that</p><formula xml:id="formula_0">I(Xi, Xj)=I(Xi)+I(Xj)=f(P•Q)=f(P)+f(Q).</formula><p>It follows that the function f(pi) is logarithmic. Therefore, the amount of information is related to the a priori probability ratio 𝐼𝐼(𝑋𝑋 𝑖𝑖 ) = 𝑘𝑘 • 𝑙𝑙𝑙𝑙𝑙𝑙 𝑝𝑝 𝑖𝑖 , here k -the capacity of the probable message alphabet; pi -the probability of the i-th message Xi -random value of the хі -th message; к and the base of the logarithm can be arbitrary. That the amount of information was determined by a non-negative number, taken k= -1, and the basis of the logarithm for ease of calculation on a computer choose 2, then we have:</p><formula xml:id="formula_1">𝐼𝐼(𝑋𝑋 𝑖𝑖 ) = − 𝑙𝑙𝑙𝑙𝑙𝑙 𝑝𝑝 𝑖𝑖 .</formula><p>That is log 𝑝𝑝 𝑖𝑖 = 2 𝐼𝐼(𝑋𝑋 𝑖𝑖 ) and in general evidence for computer:</p><formula xml:id="formula_2">𝐼𝐼(𝑋𝑋 𝑖𝑖 ) = ∑ 𝑝𝑝 𝑖𝑖 𝑘𝑘 𝑖𝑖=1 log 2 𝑝𝑝 𝑖𝑖<label>(1)</label></formula><p>In this case, a unit of information is also taken bit. Thus, a bit is the amount of information in a message of a discrete source, the alphabet of which consists of two alternative events that are a priori equally likely. If the number of a priori equally probable events is 28, then the byte is taken as a unit of information.</p><p>If the source of information gives a sequence of interdependent messages, then receiving each of them changes the probability of occurrence of the following and, accordingly, the amount of information in them. In this case, the amount of information is expressed through the conditional probability of choosing the source of the message xi, provided that the messages xi-1, xi-2 …, i.e.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝐼𝐼(𝑋𝑋</head><formula xml:id="formula_3">𝑖𝑖 /𝑋𝑋 𝑖𝑖−1 , 𝑋𝑋 𝑖𝑖−2 , … ) = − log 2 𝑝𝑝(𝑥𝑥 𝑖𝑖 /𝑥𝑥 𝑖𝑖−1 , 𝑥𝑥 𝑖𝑖−2 , … )<label>(2)</label></formula><p>The amount of information I(X) is a random variable because the messages themselves are random. The law of probability distribution I(X) is determined by the probability distribution P(X) of the ensemble of source messages.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">The concept of source entropy</head><p>The entropy of the source (specific amount of information) is the amount of information contained in one elementary message xi. The entropy of the source is determined by the formula introduced by Claude Shannon in 1948 <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b34">35]</ref>:</p><formula xml:id="formula_4">𝐻𝐻(𝑋𝑋) = − ∑ 𝑝𝑝 𝑖𝑖 𝑘𝑘 𝑖𝑖=1 log 2 𝑝𝑝 𝑖𝑖 = ∑ 𝑝𝑝 𝑖𝑖 𝑁𝑁−1 𝑖𝑖=0 log 2 � 1 𝑝𝑝 𝑖𝑖 �,<label>(3)</label></formula><p>here 𝐻𝐻(𝑋𝑋) -the entropy of the source; 𝑝𝑝 𝑖𝑖 -the frequency with which the i-th letter occurs in the language in which the message is written.</p><p>k -the number of letters in the source alphabet.</p><p>Here log 2 1 𝑝𝑝 𝑖𝑖 is interpreted as a certain amount of information 𝐼𝐼 𝑖𝑖 , obtained during the implementation of the i-th option. Entropy in Shannon's formula is the average value of a set of a sequence of numbers with different information capacity, i.e. it is a mathematical expectation of the distribution of a quantity 𝐼𝐼 0 , 𝐼𝐼 1 , … , 𝐼𝐼 𝑁𝑁−1 .</p><p>The physical content of entropy is an average measure of the uncertainty of the knowledge of the recipient of information about the state of the observed object.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Formulation of the problem</head><p>Moore's Law is an empirical law according to which the number of transistors in a crystal of one integrated circuit doubled every year for the first 15 years, and then, and to this day, such doubling occurs every 1.5 years. Therefore, if the first silicon chips were implemented on the technology of tens of microns, today the working control is carried out at 10 nm (Intel), 7 nm Qualcomm Snapdragon 865+ (AMD) and 5 nm (Apple A14). IBM has demonstrated a "quantum mirage" effect, in which an atom can store one bit of information <ref type="bibr" target="#b18">[19]</ref>. In addition, one atom is the limit beyond which quantum effects can be a real issue with reliability, as the behavior of such small objects begins to be described by the rules of quantum physics, such as electronic tunneling. Therefore, nanoconductors can no longer conduct electrons according to the laws of classical theory -in the usual way: in the form of a stream of charged particles in a solid. Recall that quantum mirages were discovered by Hari Manoharan, Christopher Lutz.</p><p>If Moore's Law continues to operate, in less than 20 years the size of the integrated circuit will be at the level of atoms. That is, the laws of their operation will be determined by quantum mechanics. Today, there are many inconsistencies in describing the behavior of nanoworld objects in classical systems. For example, the very fact of observing an atom disturbs its motion, and the absence of observation leads to a blurring of its velocity and trajectory (lack of trajectory -the ratio of Heisenberg uncertainty) -as if it is in several places at once (at one point in time). Thus, quantum effects are perceived as an obstacle in the design of ultra-small computers. Quantum computer science must figure out how to use fundamental quantum properties.</p><p>Fundamental interactions appeared due to spontaneous symmetry breaking in the first moments of the universe's existence. Modern cosmological theories consider the evolution of the universe, starting with the so-called Planck moment, 5.4 × 10-44s. After that, the only field that had the greatest symmetry disintegrated, and gravity separated from it. To avoid a long description, we reflect the current state in Fig. <ref type="figure">1:</ref> So, the formulation of the problem: Problem 1 -reducing the size of computational elements and integrated circuits has a natural limit -the point when the laws of quantum information theory will replace the laws of classical information theory, respectively, there is a need to explore the extension of information theory to quantum information theory.</p><p>Problem 2 -reducing the share of energy dissipated. Logically inverse operations are operations that are not accompanied by energy dissipation <ref type="bibr">(Landauer, 1961)</ref>. Thus, to perform classical calculations requires a physical system that has two stable states, such as triggers in electronics, which provide information in the form of a binary system.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Research of quantum properties of information carriers</head><p>The idea of using quantum properties of information carriers to accelerate the process of computation and development of the quantum computer is attributed to the American physicist R.-F. Feynman <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b7">8]</ref>, and improvement to the English physicist D. Deutsch <ref type="bibr" target="#b8">[9]</ref>. E. Bernstein and W.W. Vazirani in 1993 proved the possibility of performing an arbitrary unary operation in quantum calculations using a finite number of operations (universality of the quantum Turing machine) <ref type="bibr" target="#b9">[10]</ref>. American scientists P. Shore and L. Grover have developed algorithms that fully use quantum interference and entanglement for significant (compared to classical) computational acceleration <ref type="bibr" target="#b10">[11,</ref><ref type="bibr" target="#b11">12]</ref>. Methods of controlling nanoscopic particles by creating and controlling coherent quantum states, which led to the creation of experimental implementations of qubits (quantum information carrier), are presented. Additional studies of quantum computing can be found in <ref type="bibr" target="#b12">[13]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure1: Basic forces of interaction and elementary particles</head><p>In practice, it can be said that commercial devices for creating quantum communication lines (QPN Security Gateway by MagiQ Technologies (USA), cryptosystems Clavis and Cerberis by ID Quantique (Switzerland)) have long been on the market. In the last decade, leading laboratories have been fighting for quantum dominance at the level of commercialization of quantum computers <ref type="bibr" target="#b33">[34]</ref>. Thus, today, we see that the IT industry is preparing for the transition to a new ideology of servicing information flows. Accordingly, Ukrainian participants must prepare for the rules of the game of the future.</p><p>Therefore, consider the known elements of quantum information transfer. By analogy with the classical theory of information, we systematize the concept of quantum information theory.</p><p>Definition. Quantum information -information contained in the state of a quantum system. It is the subject of the study of quantum information theory.</p><p>Definition. A quantum object is an object of the nanoworld (electrons, atoms, molecules, light clusters) to which the rules of quantum theory apply, in particular, its description in terms of states that are statistical in relation to all measurement results;</p><p>The information carrier is the state of the quantum system H, which is an information resource because it is statistically uncertain</p><p>The state of a quantum object is a list (catalog) of possible measurement results performed on it. In quantum mechanics, two states of objects are considered: pure and mixed.</p><p>Pure states describe objects that are independent of all other quantum objects around them. Mathematically, the pure state is given by the state vector (wave function), which is usually written in Dirac notation as a cat vector |Ψ⟩. This vector belongs to the multidimensional complex Euclidean space, which is called the Hilbert space of the physical system. The dimension of the Hilbert space D specifies an important parameter -the number of independent states (levels) of the quantum system. Using as orthogonal vectors mutually orthogonal vectors |𝑖𝑖⟩, forming a complete set ∑ |𝑖𝑖⟩⟨𝑖𝑖| 𝐷𝐷 𝑖𝑖=1</p><p>= 𝐼𝐼 ̂, we can represent an arbitrary state vector in the form of a linear superposition of basis vectors :</p><formula xml:id="formula_5">|Ψ⟩ = ∑ |𝑖𝑖⟩⟨𝑖𝑖| 𝐷𝐷 𝑖𝑖=1 = 𝐼𝐼 ̂ (4)</formula><p>The choice of basis is determined by the procedure of the physical experiment and its integral part -measurement. There are an infinite number of orthogonal bases, and hence an infinite number of different representations of an arbitrary state vector.</p><p>The simplest example Mixed states are described using a density matrix:</p><formula xml:id="formula_6">|Ψ⟩ = ∑ |𝑖𝑖⟩⟨𝑖𝑖| 𝐷𝐷 𝑖𝑖=1 = 𝐼𝐼 ̂<label>(5)</label></formula><p>The simplest example of a superposition might be a state vector of a system having two orthogonal states and |𝛹𝛹 1 ⟩ and |𝛹𝛹 2 ⟩ <ref type="bibr" target="#b15">[16]</ref>. The state of such an object is described by a state vector (wave function):</p><formula xml:id="formula_7">|𝛹𝛹⟩ = 𝛼𝛼|𝛹𝛹 1 ⟩ + 𝛽𝛽|𝛹𝛹 2 ⟩ ,<label>(6)</label></formula><p>here 𝛼𝛼 𝑎𝑎𝑎𝑎𝑎𝑎 𝛽𝛽 -complex numbers or amplitudes of states, when</p><formula xml:id="formula_8">|𝛼𝛼| 2 + |𝛽𝛽| 2 = 1.<label>(7)</label></formula><p>During the measurement, the coherent superposition ( <ref type="formula" target="#formula_7">6</ref>) is destroyed and reduced to a new state, which is determined by the type of measurement. Yes, when trying to find a system in the state |𝛹𝛹 2 ⟩ perturbation of the measuring instrument will lead to the fact that at the time of measurement there will be a reduction (design):</p><formula xml:id="formula_9">|𝛹𝛹 ⟩⇒ |𝛹𝛹 2 ⟩⟨𝛹𝛹 2 |𝛹𝛹⟩⇒|𝛹𝛹 2 ⟩,<label>(8)</label></formula><p>as a result of which the system after measurement will pass to the state |𝛹𝛹 2 ⟩, and the initial state will cease to exist.</p><formula xml:id="formula_10">𝑝𝑝 𝑚𝑚𝑖𝑖𝑚𝑚 = |𝛼𝛼| 2 |𝛹𝛹 1 ⟩⟨𝛹𝛹 1 | + |𝛽𝛽| 2 |𝛹𝛹 2 ⟩⟨𝛹𝛹 2 | (<label>9</label></formula><formula xml:id="formula_11">)</formula><p>This state is essentially classical, because in the mixed state (9) the system can be either in the state |𝛹𝛹 1 ⟩, or in the state |𝛹𝛹 2 ⟩, whereas in the superposition state (6) the system can be in two states simultaneously.</p><p>In the work of Erwin Schrödinger "The current state of quantum mechanics" <ref type="bibr" target="#b13">[14]</ref> analyzed the features of quantum mechanical processes and formulated four main provisions that characterize the state of a quantum object:</p><p>The principle of superposition. The state of a quantum object is described by a linear combination of basis states;</p><p>The principle of interference. The measurement result depends on the relative phases of the wave functions included in the superposition state;</p><p>Entanglement of quantum states. Complete information about the state of the whole system does not correspond to the same complete information about the state of its components;</p><p>Non-cloning and uncertainty. The unknown quantum state cannot be copied or observed without its perturbation -the state is described only statistically <ref type="bibr" target="#b14">[15]</ref>.</p><p>Quantum entanglement states are a quantum mechanical phenomenon in which the quantum states of two or more objects are interdependent. This interconnection persists even if the entangled particles are spatially spaced beyond any known interactions. Measuring the parameter of one particle causes instantaneous (more than the speed of light) destruction of the confused state and determining the state of the second particle with one hundred percent probability. Such behavior does not agree with the principle of locality, but does not violate the theory of relativity, because there is no transfer of information.</p><p>A good example of confused states are photon pairs in Bell states <ref type="bibr" target="#b16">[17]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">. Quantum calculations</head><p>The changes that occur with the quantum state can be described in the language of quantum calculations. The fundamental model of quantum computing is quantum schemes. By analogy with the classical computer, which contains wires and logic elements, a quantum computer is built of quantum circuits consisting of wires and elementary quantum elements that allow the transmission of quantum information and manipulate it. The evolution of an unmeasured quantum system translates the initial state of the quantum system into another state while maintaining the norm. For Hilbert space, the transformation must be reversible, i.e. unitary. Any transformation on a d-dimensional complex vector space can be described using a matrix of size d × d. Let M* be a transposed complex-conjugate matrix with respect to the matrix M. A matrix M is called unitary (one that describes unitary transformations) if the condition M*M=1 is satisfied. An arbitrary unitary transformation of quantum space is an admissible quantum transformation, and vice versa. Thus, the condition of unitarily is the only restriction imposed on quantum elements. Unitary transformation can be interpreted as rotations in a complex vector space.</p><p>A quantum computer is a device that performs logical operations on quantum states by unary transformations (that is, energy-saving ones) without disturbing quantum superposition in the computational process. Schematically, the operation of a quantum computer can be represented as a sequence of three operations:</p><p>1) "record" -reading the initial state; 2) "calculations" -unitary transformations of initial states; 3) "output" of the result (measurement, design of the final state).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Qubit</head><p>By analogy with a classical computer operating on a sequence of classical bits, a quantum computer operates on a sequence of quantum bits. Thus, the fundamental unit of information in quantum information systems is a quantum bit (quantum bit) or abbreviated qubit (qubit). Some quantum system with two stable states can be used to represent the qubit. Many different physical systems are used to implement qubits. For example, in a model of an atom, an electron can exist either in the ground |0⟩ or in the excited |1⟩ states. By irradiating the atom with light with a certain energy, it is possible to make transitions between these states.</p><p>A significant difference between a qubit and a classical bit is that a qubit can be in an indeterminate (non-statistical) state other than 0 or 1. Let us call this state non-statistical in contrast to |0⟩ and |1⟩, which are statistical states.</p><p>A linear combination of states is a superposition:</p><formula xml:id="formula_12">|𝛹𝛹 ⟩ = 𝛼𝛼|0⟩ + 𝛽𝛽|1⟩<label>(10)</label></formula><p>We now show the rule of change in the classical addition (table <ref type="table" target="#tab_0">1</ref>) and the use of "quantum entanglement" (entanglement of quantum states) (table <ref type="table">2</ref>). </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Classic bitwise addition</head><formula xml:id="formula_13">a b a⊕b 0 0 0 1 0 1 0 1 1 1 1 0 Table 2</formula><p>Addition taking into account the quantum effect</p><formula xml:id="formula_14">a b a' b' = (a⊕b) 0 0 0 0 1 0 1 1 0 1 0 1 1 1 1 0</formula><p>In table 2, the value of qubit a is stored, the value of qubit b changes according to the law XOR. Bit b -(target) changes its state only when the state of the control bit = 1; the state of the control bit does not change. Thus, we see why, in the general case, logical data can be cloned and quantum data cannot. In the general case, quantum data means the superposition of the form:</p><formula xml:id="formula_15">|𝛹𝛹⟩ = 𝛼𝛼|𝛹𝛹⟩ + 𝛽𝛽|𝛹𝛹⟩</formula><p>here 𝛼𝛼 і 𝛽𝛽 -complex numbers or amplitudes of states, when |𝛼𝛼| 2 і |𝛽𝛽| 2 = 1.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Quantum entropy (von Neumann entropy)</head><p>Suppose that for a quantum mechanical system of density 𝑝𝑝̂ we have |𝑝𝑝 𝑖𝑖 ⟩ -eigenvectors of the density matrix corresponding to the eigenvalues p_i (for simplicity, we take them as nondegenerate matrices), then</p><formula xml:id="formula_16">𝑝𝑝̂𝑖𝑖|𝑝𝑝 𝑖𝑖 ⟩ = 𝑝𝑝 𝑖𝑖 |𝑝𝑝 𝑖𝑖 ⟩,</formula><p>here 𝑝𝑝 𝑖𝑖 -the probability of finding a quantum system in the pure state 𝑝𝑝̂𝑖𝑖 = |𝑝𝑝 𝑖𝑖 ⟨𝑝𝑝 𝑖𝑖 | . Here 0 ≤ 𝑝𝑝 𝑖𝑖 ≤ 1.</p><p>In the basis, {|𝑝𝑝 𝑖𝑖 } the density matrix takes a diagonal form. Therefore, in the basis of eigenvectors, quantum entropy (or von Neumann entropy) can be determined similarly to the classical (information entropy H(X) Shannon using eigenvalues:</p><formula xml:id="formula_17">𝑆𝑆 = − ∑ 𝑝𝑝 𝑖𝑖 ln 𝑝𝑝 𝑖𝑖 𝑖𝑖 ,</formula><p>here s -it is a theoretical and informational entropy. In quantum information theory, quantum relative entropy is a measure of the difference between two quantum states (a quantum-mechanical analogue of relative entropy] <ref type="bibr" target="#b20">[21]</ref>.</p><p>In contrast to classical information theory, quantum theory contains the concept of entropy of entanglement.</p><p>Entropy entanglement is a measure of the degree of quantum entanglement of two subsystems that form two parts of the composite of a quantum system. Thus, the entropy of entanglement is the von Neumann entropy of the density matrix for an arbitrary subsystem. If it is not equal to 0, then the system is in a mixed state, which means that the two systems are entangled.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Research results and their discussion</head><p>Quantum information theory. The main tasks of Ph.D. is the establishment of conceptual capabilities and limitations of receiving, transmitting and processing information in quantum media (systems that operate according to the laws of quantum mechanics). It is believed that the theory of classical information works with shortcomings in its use in the real world (quantum world). Schematically, this can be represented as</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.">Quantum information ⊂ Classical information ⊂ Information technology</head><p>The concept of communication channel and its maximum bandwidth is an important element in quantum information theory, because the effect of quantum entanglement allows not to send information physically, through quantum teleportation.</p><p>Obviously, the application of quantum information theory is necessary when information is received, stored, transmitted not by bits, but in terms of quantum states.</p><p>Determining the degree of confusion for systems with more than two components, as well as for noisy systems in the so-called mixed states, is a separate problem of quantum information theory. Fundamental developments in this direction belong to the school of Polish physicists Gorodetsky <ref type="bibr" target="#b17">[18]</ref>. It is believed that the definition is a principle. restrictions on the confusion that can be released for information processing will make it possible to formulate the postulates of quantum information theory by analogy with the postulates of thermodynamics. Currently, the main problem of quantum information theory is to overcome the so-called quantum gap -the transition from already implemented computers with 5-10 qubits to a machine that can create superpositions and confused states of 1000 qubits and perform (until the state decays) at least 109 operations <ref type="bibr" target="#b18">[19]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Experiments and Results in quantum theory area</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Symmetry</head><p>The modern theory of everything (superstring theory), which claims to be the unifying theory of all four fundamental interactions, is based on a model of supersymmetry. Supersymmetry is a theory that connects bosons and fermions in nature (we can say that the transformation of supersymmetry can translate matter into interaction (or radiation), and vice versa). Supersymmetry provides a union with gravity (local supersymmetry is the theory of gravity); leads to the union of strong, weak and electromagnetic interactions (the theory of the Great Union); solves the problem of hierarchies (simultaneous existence of large and small scales); creates insufficient dark matter in the universe. Supersymmetry provides superstring theory with consistency and stability. Supersymmetry "relieves us of the need to fine-tune the parameters of the standard model to overcome a number of subtle problems in quantum theory ... at insignificantly short distances, supersymmetry changes the intensity of three non-gravitational interactions so that they can merge into one large combined interaction" <ref type="bibr" target="#b26">[27]</ref>.</p><p>Parts of the construction of string theory gradually fell into place" <ref type="bibr" target="#b27">[28]</ref>. The new symmetry in physics is called supersymmetry. She argues that in the permutation of bosonic and fermionic particles, the physical laws must remain unchanged. It is like a mirror image of nature, in which fermions turn into bosons and bosons into fermions. The search for various manifestations of supersymmetry in nature is one of the main tasks of numerous experiments on modern particle accelerators. Symmetry is the basis of all the fundamental laws of physics: the law of conservation of momentum as a consequence of the homogeneity of space; the law of conservation of momentum as a consequence of isotropy of space; the law of conservation of energy as a consequence of the homogeneity of time; the law of conservation of velocity of the center of mass (consequence of isotropy of space-time). This has been actively explored in the works <ref type="bibr" target="#b28">[29]</ref>. Systems were built using simulation based on a quantum computer in <ref type="bibr" target="#b29">[30]</ref>. Image protection was implemented in <ref type="bibr" target="#b30">[31]</ref>. Software and hardware were implemented in <ref type="bibr" target="#b31">[32]</ref> for the mobile system. Neural networks have been used to encrypt and decrypt data in <ref type="bibr" target="#b32">[33]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Study 2021</head><p>The standard model is a currently accepted theoretical construction that describes the interaction of all elementary particles in the universe. It assumes four fundamental interactions: electromagnetic, strong, weak, and gravitational.</p><p>However, this is by no means a definitive theory. This is evidenced, for example, by the presence in the universe of dark matter or antimatter, which does not fit into the Standard Model. And now scientists are approaching the so-called New Physics.</p><p>The standard model accurately predicted the so-called muon g-factor, an indicator of the strength and speed of rotation of a particle in a magnetic field. This factor is close to the value of 2, but the Brookhaven experiments revealed a deviation of several parts per million.</p><p>Despite the minimal difference, the scientists claimed the existence of previously unknown to science interactions between the muon and the magnetic field.</p><p>The Muon g-2 <ref type="bibr" target="#b33">[34]</ref> experiment at the Fermi National Accelerator Laboratory (Fermilab) in Chicago on April 7, 2021 published the results of an experiment that was to measure the value of the anomalous magnetic moment of a muon with high accuracy.</p><p>The current state of research <ref type="bibr" target="#b34">[35]</ref> shows a possible change in both unifying theory and the theory of everything. Forces of interaction model can be tested in the near future with accelerator-based experiments and possibly also at the precision frontier. The first result from the Muon g-2 experiment at Fermilab confirms the result from the experiment performed at Brookhaven National Lab two decades ago. Together, the two results show strong evidence that muons diverge from the Standard Model prediction. Image <ref type="bibr" target="#b35">[36]</ref>.</p><p>Thus, in the course of research as part of the Muon g-2 experiment in the laboratory of the town of Batavia near Chicago (with a probability of 1 chance out of 40,000, i.e. the statistical level of reliability is 4.1 sigma), a new, fifth force of nature was discovered <ref type="bibr" target="#b36">[37]</ref><ref type="bibr" target="#b37">[38]</ref><ref type="bibr" target="#b38">[39]</ref><ref type="bibr" target="#b39">[40]</ref>. Probably because, the permissible error leaves to recognize the discovery by science, the error should not exceed one chance by 3.5 million (5 sigma).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusions</head><p>Obviously, the era of silicon electronics is nearing completion, and biotechnologies that operate on DNA molecules and quantum technologies that operate on ions, atoms, and elementary particles are replacing on-technology.</p><p>Quantum computing and quantum information are new tools that will create a link between simple and relatively complex: in the field of calculations and algorithms there are systematic tools for building and studying such systems. The application of ideas from these areas has already led to the emergence of new views on physics, so the authors contributing to the expansion of general information theory by supplementing by integrating into its foundation the rules of computation in quantum systems. The author systematizes the concept of different industries and introduces the concept of non-statistical state.</p><p>To understand further development, it is necessary to formalize the current state of affairs. Procedures for determining all the rules of interaction and construction of the corresponding algebra today are called theories of everything.</p><p>Definition. Fundamental forces -different types of interaction that are not reduced to each other. The fundamental forces described are gravitational, electromagnetic, strong and weak interactions. It is considered (the theory of everything) that all these 4 interactions are separate cases of one, still unknown, hypothetical interaction. The case of describing the theory of everything is constantly supplemented by new manifestations, which cannot be substantiated by the above-mentioned four fundamental forces. In particular, such quantum effects as quantum entanglement and uncertainty without observation and acceptance of value in the process of observation cannot be justified by the influence of one of the four forces.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Correlation of oscillation frequency with the standard model (Fermilab)</figDesc><graphic coords="11,195.05,503.54,213.95,160.54" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0"><head></head><label></label><figDesc></figDesc><graphic coords="6,102.35,80.80,440.66,255.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc></figDesc><table /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Future of Artificial Intelligence: treats and possibility</title>
		<author>
			<persName><forename type="first">V</forename><surname>Hrytsyk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of ITA&apos;2017, INFOS section</title>
				<meeting>ITA&apos;2017, INFOS section<address><addrLine>Varna</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">June, 26-Luly, 09, 2017</date>
			<biblScope unit="page" from="91" to="99" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Augmented reality for people with disabilities</title>
		<author>
			<persName><forename type="first">V</forename><surname>Hrytsyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Grondzal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bilenkyj</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Xth International Scientific and Technical Conference &quot;Computer Sciences and Information Technologies</title>
				<imprint>
			<publisher>CSIT</publisher>
			<date type="published" when="2015">2015. 2015</date>
			<biblScope unit="page" from="188" to="191" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Real-Time Sensing, Reasoning and Adaptation for Computer Vision Systems</title>
		<author>
			<persName><forename type="first">V</forename><surname>Hrytsyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nazarkevych</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-82014-5_39</idno>
		<ptr target="https://doi.org/10.1007/978-3-030-82014-5_39" />
	</analytic>
	<monogr>
		<title level="m">Lecture Notes in Computational Intelligence and Decision Making, ISDMCI 2021</title>
		<title level="s">Lecture Notes on Data Engineering and Communications Technologies</title>
		<editor>
			<persName><forename type="first">S</forename><surname>Babichev</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">V</forename><surname>Lytvynenko</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">77</biblScope>
			<biblScope unit="page" from="573" to="585" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Hyperspace: A scientic odyssey through parallel universes, time warps</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kaku</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">and the tenth dimension</title>
				<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page">384</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Communication theory of secrecy systems</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">E</forename><surname>Shannon</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">The Bell system technical journal</title>
		<imprint>
			<biblScope unit="volume">28</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="656" to="715" />
			<date type="published" when="1949">1949</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Systematyzatsiia zavdan informatsiinykh tekhnolohii epokhy 4-yi promyslovoi revoliutsii</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">V</forename><surname>Hrytsyk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Visnyk KhNTU</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="issue">66</biblScope>
			<biblScope unit="page" from="265" to="270" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Quantum mechanical computers</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">P</forename><surname>Feynman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Conference on Lasers and Electro-Optics (p. TUAA2)</title>
				<imprint>
			<publisher>Optical Society of America</publisher>
			<date type="published" when="1984-06">1984. June</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Quantum theory, the Church-Turing principle and the universal quantum computer</title>
		<author>
			<persName><forename type="first">D</forename><surname>Deutsch</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Proceedings of the Royal Society of London, Series A, Mathematical and Physical Sciences</title>
		<imprint>
			<biblScope unit="volume">400</biblScope>
			<date type="published" when="1818">1985. 1818</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Quantum complexity theory</title>
		<author>
			<persName><forename type="first">E</forename><surname>Bernstein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Vazirani</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 25&apos;th Annual ACM Symposium on the Theory of Computing</title>
				<meeting>the 25&apos;th Annual ACM Symposium on the Theory of Computing<address><addrLine>New York</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1993">1993</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Algorithms for quantum computation: Discrete logarithms and factoring</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">W</forename><surname>Shor</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 35&apos;th Annual Symposium on Foundations of Computer Science</title>
				<meeting>the 35&apos;th Annual Symposium on Foundations of Computer Science<address><addrLine>Los Alamitos</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1994">1994</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Quantum information theory</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">H</forename><surname>Bennett</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">W</forename><surname>Shor</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transactions on Information Theory</title>
		<imprint>
			<biblScope unit="volume">44</biblScope>
			<date type="published" when="1998">1998</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<title level="m" type="main">Quantum computation and quantum information</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Nielsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">L</forename><surname>Chuang</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2000">2000</date>
			<pubPlace>Cambridge</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Schrödinger</surname></persName>
		</author>
		<title level="m">Collected Papers on Wave, Mechanics</title>
				<imprint>
			<date type="published" when="1982">1982</date>
			<biblScope unit="page" from="102" to="123" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Quantum information and computation</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">H</forename><surname>Bennett</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Physics Today</title>
		<imprint>
			<biblScope unit="volume">48</biblScope>
			<biblScope unit="issue">10</biblScope>
			<biblScope unit="page" from="24" to="30" />
			<date type="published" when="1995">1995</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Quantum complexity theory</title>
		<author>
			<persName><forename type="first">E</forename><surname>Bernstein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Vazirani</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 25&apos;th Annual ACM Symposium on the Theory of Computing</title>
				<meeting>the 25&apos;th Annual ACM Symposium on the Theory of Computing<address><addrLine>New York</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1993">1993</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">J</forename><surname>Jang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">H</forename><surname>Bui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Choi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Wolf</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Delgado</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Bae</surname></persName>
		</author>
		<idno>arXiv, 2103.09582</idno>
		<title level="m">Spin resonance amplitude and frequency of a single atom on a surface in a vector magnetic field</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Kryterii otsiniuvannia spotvoren kvantovoi informatsii pry peredachi po kvantovomu kanalu zviazku z shumom</title>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">A</forename><surname>Pastukh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">V</forename><surname>Yatsyshyn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">M</forename><surname>Maikiv</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">V</forename><surname>Hrytsyk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Visnyk Khmelnytskoho natsionalnoho universytetu</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="page" from="127" to="129" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Nielsen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">L</forename><surname>Chuang</surname></persName>
		</author>
		<title level="m">Quantum computing and quantum information</title>
				<imprint>
			<date type="published" when="2000">2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Fundamentals of quantum information theory</title>
		<author>
			<persName><forename type="first">M</forename><surname>Keyl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Physics reports</title>
		<imprint>
			<biblScope unit="volume">369</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="431" to="548" />
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">General properties of entropy</title>
		<author>
			<persName><forename type="first">A</forename><surname>Wehrl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Reviews of Modern Physics</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page">221</biblScope>
			<date type="published" when="1978">1978</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Unified approach to quantum capacities: towards quantum noisy coding theorem</title>
		<author>
			<persName><forename type="first">M</forename><surname>Horodecki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Horodecki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Horodecki</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Physical review letters</title>
		<imprint>
			<biblScope unit="volume">85</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page">433</biblScope>
			<date type="published" when="2000">2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Quantum information theory</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">H</forename><surname>Bennett</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">W</forename><surname>Shor</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE transactions on information theory</title>
		<imprint>
			<biblScope unit="volume">44</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="2724" to="2742" />
			<date type="published" when="1998">1998</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Grand Unified Theories: Current Status and Future Prospects</title>
		<author>
			<persName><forename type="first">T</forename><surname>Fukuyama</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Kikuchi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">An International Workshop, Grand Unified Theories: Current Status and Future Prospects</title>
				<imprint>
			<date type="published" when="2008">2008</date>
			<biblScope unit="page">1015</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<author>
			<persName><forename type="first">B</forename><surname>Green</surname></persName>
		</author>
		<title level="m">The elegant universe: Superstrings, hidden dimensions, and the quest for the ultimate theory</title>
				<meeting><address><addrLine>Vintage London</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1999">1999</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">The role of symmetry in fundamental physics</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Gross</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Proceedings of the National Academy of Sciences</title>
		<imprint>
			<biblScope unit="volume">93</biblScope>
			<biblScope unit="issue">25</biblScope>
			<biblScope unit="page" from="14256" to="14259" />
			<date type="published" when="1996">1996</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<monogr>
		<author>
			<persName><forename type="first">R</forename><surname>Balkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Delaunay</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Geller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Kajomovitz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Perez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Shpilman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Soreq</surname></persName>
		</author>
		<idno>arXiv, 2104.08289</idno>
		<title level="m">A Custodial Symmetry for Muon g-2</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Muon g-2 collaboration, Measurement of the Positive Muon Anomalous Magnetic Moment to 0.46 ppm</title>
		<author>
			<persName><forename type="first">B</forename><surname>Abi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Phys. Rev. Lett</title>
		<imprint>
			<biblScope unit="volume">126</biblScope>
			<biblScope unit="page">2021</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Muon g-2 collaboration, Magnetic Field Measurement and Analysis for the Muon g-2 Experiment at Fermilab</title>
		<author>
			<persName><forename type="first">T</forename><surname>Albahri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Phys. Rev. A</title>
		<imprint>
			<biblScope unit="volume">103</biblScope>
			<biblScope unit="page">2021</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">The Ateb-Gabor Filter for Fingerprinting</title>
		<author>
			<persName><forename type="first">M</forename><surname>Nazarkevych</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Logoyda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Troyan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Vozniy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Shpak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Computer Science and Information Technology</title>
				<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="247" to="255" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Biometric Identification System with Ateb-Gabor Filtering</title>
		<author>
			<persName><forename type="first">M</forename><surname>Nazarkevych</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Lotoshynska</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Brytkovskyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dmytruk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Dordiak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Pikh</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">XIth International Scientific and Practical Conference on Electronics and Information Technologies (ELIT)</title>
				<imprint>
			<date type="published" when="2019">2019. 2019</date>
			<biblScope unit="page" from="15" to="18" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Identification of Biometric Images using Latent Elements</title>
		<author>
			<persName><forename type="first">M</forename><surname>Logoyda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nazarkevych</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Voznyi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dmytruk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Smotr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">CEUR Workshop Proceedings</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Hardware and software tools for motion control of mobile robotic system</title>
		<author>
			<persName><forename type="first">I</forename><surname>Tsmots</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Teslyuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Vavruk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">12th International Conference on the Experience of Designing and Application of CAD Systems in Microelectronics (CADSM)</title>
				<imprint>
			<date type="published" when="2013">2013. 2013</date>
			<biblScope unit="page" from="368" to="368" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<analytic>
		<title level="a" type="main">Neural-like means for data streams encryption and decryption in real time</title>
		<author>
			<persName><forename type="first">I</forename><surname>Tsmots</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Tsymbal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Khavalko</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Skorokhoda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Tesluyk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IEEE Second International Conference on Data Stream Mining &amp; Processing (DSMP)</title>
				<imprint>
			<date type="published" when="2018">2018. 2018</date>
			<biblScope unit="page" from="438" to="443" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">Muon g-2 collaboration, Measurement of the anomalous precession frequency of the muon in the Fermilab Muon g-2 Experiment</title>
		<author>
			<persName><forename type="first">T</forename><surname>Albahri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Phys. Rev. D</title>
		<imprint>
			<biblScope unit="volume">103</biblScope>
			<biblScope unit="page">2021</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Measurement of the positive muon anomalous magnetic moment to 0.46 ppm</title>
		<author>
			<persName><forename type="first">B</forename><surname>Abi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Albahri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Al-Kilani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Allspach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">P</forename><surname>Alonzi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Anastasi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lusiani</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Physical Review Letters</title>
		<imprint>
			<biblScope unit="volume">126</biblScope>
			<biblScope unit="issue">14</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<monogr>
		<ptr target="https://news.fnal.gov/2021/04/first-results-from-fermilabs-muon-g-2-experiment-strengthen-evidence-of-new-physics/" />
		<title level="m">First results from fermilabs muon g2 experiment strengthen evidence of new physics</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">Removing leakage-induced correlated errors in superconducting quantum error correction</title>
		<author>
			<persName><forename type="first">M</forename><surname>Mcewen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Kafri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Atalaya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">J</forename><surname>Satzinger</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Quintana</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Barends</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Nature communications</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="1" to="7" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">I</forename><surname>Chanyshev</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">M</forename><surname>Abdulin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">E</forename><surname>Belousova</surname></persName>
		</author>
		<title level="m">Mining informational and analytical bulletin</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
	<note>scientific and technical journal</note>
</biblStruct>

<biblStruct xml:id="b38">
	<monogr>
		<title level="m" type="main">Mathematical theory of communication</title>
		<author>
			<persName><forename type="first">K</forename><surname>Krippendorff</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2009">2009</date>
			<publisher>ASC</publisher>
			<biblScope unit="page">169</biblScope>
		</imprint>
	</monogr>
	<note type="report_type">Departmental Papers</note>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">6G networks: Beyond Shannon towards semantic and goaloriented communications</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">C</forename><surname>Strinati</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Barbarossa</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computer Networks</title>
		<imprint>
			<biblScope unit="volume">190</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
