<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Characteristics of Ecosystems of Quantum Prospects for Their Use in Transport</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Petr Polikarpov</string-name>
          <email>p.polikarpov@abaqs.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nikolay Uvarov</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anatoly Khomonenko</string-name>
          <email>khomon@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Emperor Alexander I St. Petersburg State Transport University</institution>
          ,
          <addr-line>9 Moskovsky pr., Saint Petersburg, 190031</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LLC "Abakus</institution>
          ,
          <addr-line>Bolshaya Pushkarskaya street, 47 lit a, St. Petersburg, 197101, Russian Federation</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>St. Petersburg information and computing center - structural unit of the main computer center - branch of the open joint stock company "Russian Railways"</institution>
          ,
          <addr-line>Borovaya street, 57 St. Petersburg, 192007, Russian Federation</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>An overview of modern software ecosystems enabling quantum computing is presented. The differences between ecosystems of quantum computing (EQC) and ecosystems of classical computing are highlighted. Provides a brief description of the most advanced quantum computing ecosystems (Google, IBM, Rigetti, Azure, Amazon, Intel, Strangeworks, IonQ). The current state of EQC, the possibilities of their use for various applications and development prospects are analyzed. Perspective areas of application of quantum computing in transport are considered.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Ecosystems of quantum computing</kwd>
        <kwd>quantum computing in transport</kwd>
        <kwd>big data</kwd>
        <kwd>logistic optimization problem</kwd>
        <kwd>Google</kwd>
        <kwd>IBM</kwd>
        <kwd>Rigetti</kwd>
        <kwd>Azure</kwd>
        <kwd>Amazon</kwd>
        <kwd>Intel</kwd>
        <kwd>Strangeworks</kwd>
        <kwd>IonQ</kwd>
        <kwd>quantum communication</kwd>
        <kwd>machine learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        1 Advanced countries, including Russia,
have adopted programs for the development of
technologies united by the general term
"Quantum computing" [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The progress made
in this area in recent years allows us to talk
about the "Quantum Revolution 2.0". Russia is
one of the seventeen countries that have
adopted and implemented a state strategy in
the field of quantum technologies. The main
directions of development here are: actually,
quantum computing, quantum communication
and quantum machine learning.
      </p>
      <p>
        As noted in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], at present, quantum
computers already exist, but they cannot yet be
widely used due to the shortcomings of the
equipment. The problems and main directions
of the development of quantum computers are
increasing the number of qubits, reducing the
noise level and increasing the lifetime of
quantum states (the so-called "depth of
calculations"). The increase in the number of
kills, all other things being equal, allows us to
use algorithms that correct, due to redundancy,
errors caused by noise. The development of
error-resistant algorithms is one of the priority
tasks in the development of quantum
computing technologies. Now there is a time
of noisy quantum computers of medium scale,
the so-called NISQ (Noisy Quantum of
Intermediate scale).
      </p>
      <p>
        As shown in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], quantum computing
cannot be used independently at the present
time. The infrastructure of data preparation,
calculation management, interpretation of
output data and presentation of results is
necessary.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. About the term "Ecosystem" and its varieties</title>
      <p>
        The term "Ecosystem" was introduced by
the English geobotanist Arthur Tensley in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
to denote the integration of the biotic
community and its physical environment as a
fundamental unit of ecology in the hierarchy
of physical systems that span the range from
the atom to the universe. Ecosystems are the
main structural units that make up the
biosphere.
      </p>
      <p>
        Over time, analogs of ecosystems have
appeared, denoting systems to ensure
functioning in modern society, such as
"Business Ecosystems". In particular, in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ],
groups of enterprises and the relationships
between them, interacting with each other
within the same niche in the software and
services market, are defined as software
ecosystems. These relationships between parts
of an ecosystem often rely on a common
technology platform. Examples of software
ecosystems today are Apple, Google,
Microsoft, and the open source ecosystem.
      </p>
      <p>
        Among software ecosystems, software
development ecosystems stand out. In
particular, [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] provides a brief topical
overview of the current state and prevalence of
software development tools among developers.
      </p>
      <p>The software development ecosystem
should include the following main
components:
- programming languages;
- tools for creating program code;
- tools for building diagrams that display
the structure of the program code (class
diagrams);
- software debugging tools;
- sets of libraries and components for the
implementation of algorithms, exchange and
presentation of data.</p>
      <p>
        For example, the Microsoft software
development ecosystem [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] includes:
      </p>
      <p>- programming languages C ++, C # and
others;</p>
      <p>- a set of development tools for MS Visual
Studio, including, in particular, debugging
tools, a class designer, a data structure
designer;
- numerous SDKs and libraries;
- cloud environment for software
development and deployment;</p>
      <p>- Windows operating systems of various
versions.</p>
      <p>With the emergence and development of
quantum computing, one can distinguish
quantum computing ecosystems (QCE), a
distinctive feature of which is the use of a
quantum computing module and / or its
emulator. These ecosystems provide access to
quantum computing and serve to:</p>
      <p>- manage existing physical quantum
computing devices,</p>
      <p>- evaluate the efficiency of the
implementation of quantum algorithms on
future devices,
- study the concepts of quantum computing,
- check quantum algorithms and their
implementations,</p>
      <p>- teach quantum computing.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Quantum ecosystems computing</title>
      <sec id="sec-3-1">
        <title>General remarks</title>
        <p>Quantum computing consists of the
following main steps:
1) data preparation,
2) preparing a quantum computing scheme,
3) loading a quantum computing scheme
and raw data into a quantum processor,
4) performing computation in a quantum
processor,</p>
        <p>5) receiving data from a quantum
processor,
6) interpretation of data.</p>
        <p>On a conventional (classical) processor,
steps 1), 2) and 6) are performed, steps 3) and
5) are associated with the transfer of data
between the quantum and classical processors,
and step 4) is performed on the quantum
processor. When debugging software at stage
4), a quantum processor simulator is used.</p>
        <p>Let's consider the most developed, at the
present time, QCE.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Google ecosystem</title>
        <p>
          Google is developing various tools built
into the company's extensive hardware and
software infrastructure [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. The main
components are: the Cirq framework and the
TensorFlow Quantum and Fermion application
libraries.
        </p>
        <p>Cirq works with quantum computing
schemes. Quantum programs in Cirq are
represented by "Scheme" and "Schedule",
where "Scheme" represents the quantum
circuit, and "Schedule" represents the quantum
circuit with information about the sequence of
actions. Programs can run on local simulators.</p>
        <p>TensorFlow Quantum is a special library
that allows Cirq circuits to be used as
TensorFlow tensors, in addition, it contains
specialized layers (tf.keras.layers) for recurrent
neural networks. This library is an example of
a mixed quantum-classical approach.</p>
        <p>Open Fermion is a specialized library of
algorithms for modeling chemical processes.</p>
        <p>QCE Google provides access to its
quantum 50-qubit computer and related
simulators.</p>
      </sec>
      <sec id="sec-3-3">
        <title>IBM ecosystem</title>
        <p>
          QCE developed by IBM is presented in
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. The software shell that provides access to
the IBM quantum computer is called Qiskit.
The basic programming language for using
Qiskit is Python. The ecosystem includes a
quantum assembler that provides access to
operations with the lowest-level qubits –
OpenQASM.
        </p>
        <p>The QCE includes the IBM Quantum
Composer tools for constructing quantum
computing circuits and the IBM Quantum Lab
development environment. The user is
provided with the following main modules:
- module for composing quantum programs
at the level of circuits and pulses with
optimization and taking into account the
physical characteristics of a particular physical
quantum computer (Terra);</p>
        <p>- simulator of quantum computing and
simulator of noise errors (Aer);</p>
        <p>- subsystem of noise reduction in quantum
circuits (Ignis);
- library of quantum algorithms (Aqua).</p>
        <p>QCE provides access to a line of
proprietary quantum computers. At the time of
this writing, the most powerful were a 27-qubit
processor with a long characteristic lifetime of
quantum states and a 67-qubit computer with a
shorter characteristic lifetime of quantum
states.</p>
        <p>For debugging programs and researching
algorithms in this QCE, access to various
simulators is provided, with a capacity of up to
1000 qubits.</p>
      </sec>
      <sec id="sec-3-4">
        <title>Rigetti ecosystem</title>
        <p>
          The Rigetti QCE is described in [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. A
feature of this QCE is the desire of developers
to provide a minimum delay for transferring
data between quantum and classical processors
at the stages of loading data into a quantum
processor, transferring a computation circuit to
a quantum processor, and receiving
computation results from a quantum processor.
        </p>
        <p>QCE Rigetti contains all the necessary
modules to perform quantum computing.</p>
        <p>Quantum operating system. Access to the
quantum operating system is provided through
network APIs. At this level, basic services are
implemented, such as:
- user authentication, service authorization,
- control of the computation scheme and its
transfer to the quantum processor,
- memory management,
-control of simultaneously-running
processes.</p>
        <p>This API is accessed using the Rigetti SDK
software.</p>
        <p>
          Quil instruction language [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] for
programming quantum computing. This
language describes quantum circuits at the
lowest level, interaction with a classical
processor and memory management. The
QuilT extension provides access to the lowest level
of qubit control.
        </p>
        <p>ForestSDK programming tools include the
pyQuil Python library and the Quilc
optimizing compiler, which can be configured
to create programs on non-Rigetti quantum
processors.</p>
        <p>A 31-qubit quantum computer is used to
execute programs. Various noise simulation
simulators are used for debugging.</p>
      </sec>
      <sec id="sec-3-5">
        <title>Azure Quantum ecosystem</title>
        <p>
          Microsoft is developing a set of tools and
technologies [
          <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
          ] integrated with the
ecosystem of classic software. QCE uses the
Q# programming language and the Quantum
SDK library of tools. User access is provided
through the Azure Quantum cloud platform.
        </p>
        <p>This QCE does not have its own quantum
computer. Access to Honewell and Quantum
Circuits quantum computers is provided.</p>
      </sec>
      <sec id="sec-3-6">
        <title>Amazon ecosystem</title>
        <p>
          QCE, developed by Amazon, bears the
commercial name Amazon Braket [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. EKV
uses widely used open source development
tools for classic software: Jupiter notebooks
with libraries installed in them. The Amazon
Braket SDK is a development platform that
you can use to create quantum algorithms and
run them on any compatible hardware
accessed through Amazon Braket. This
platform contains popular quantum algorithms
and components for working with neural
network training. For debugging, several
simulators with added noise and a tensor
neural network simulator are used. The
programs are launched on quantum computers
Rigetti, Wave-D, IonQ.
        </p>
      </sec>
      <sec id="sec-3-7">
        <title>Intel</title>
        <p>
          Intel reports that work is underway to
create an QCE [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], but so far nothing has
been presented.
        </p>
      </sec>
      <sec id="sec-3-8">
        <title>Strangeworks ecosystem</title>
        <p>
          This ecosystem collects various quantum
services for access through a single entry point
[
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. Provides its own development
environment for Python programs and access
to quantum computers Honeywell, Rigetti and
others.
        </p>
      </sec>
      <sec id="sec-3-9">
        <title>IonQ</title>
        <p>
          QCE IonQ provides access to its own
quantum computer [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] through its own
software based on the Python language, as
well as through the services Amazon Braket
and Azure Quantum.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Prospects for the</title>
      <p>development and application of</p>
    </sec>
    <sec id="sec-5">
      <title>QCE in transport</title>
      <p>
        The material [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], presented by specialists
from one of the industry leaders (IBM),
describes the development plan for QCE. This
plan reflects the general prospects for the
industry: by the end of 2022, the achievement
of 400 qubits and the real use of QCE in
scientific research, machine learning, solving
optimization problems and in the financial
industry.
      </p>
      <p>It is assumed that with the development of
QCE, software shells will develop that hide
from the user the details of the implementation
of quantum algorithms. The development of
QCE will thus make it possible to solve
applied problems for the solution of which the
computational power of classical
supercomputers is not enough.</p>
      <p>
        With the development of quantum
computers and QCE, quantum computing
algorithms will also develop in applications for
optimization problems and for analyzing big
data. The importance of big data analysis in
transport is shown in [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
optimization
      </p>
    </sec>
    <sec id="sec-6">
      <title>5. Logistic problem</title>
      <p>
        Let us consider a possible approach to
solving the problem of optimizing transport
logistics using a quantum computer. The
problem of optimization of
MozheKantorovich logistics in the trivial formulation
of a linear programming problem can be
represented as follows [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]:
where i=1,…, m.
where j=1,…, n.
      </p>
      <p>n
∑ j xi, j = ai ,</p>
      <p>m
∑i xi, j = a j ,
∑ ∑ Ci, j xi, j → min,</p>
      <p>i j
where: m, n – the number of points of
consumption and production of a
homogeneous product;</p>
      <p>ai – production volume at the i-th
production point;</p>
      <p>bj – the volume of production at the j-th
consumption point;</p>
      <p>Сij – costs of transporting a unit of goods
between nodes i and j.</p>
      <p>This problem, as has been repeatedly
shown, is NP-hard, which means that there is
no time-polynomial algorithm for solving this
problem.</p>
      <p>
        As shown in [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], the combinatorial
optimization problem, to which the transport
logistics optimization problem is reduced, can
be reduced to the problem of fulfilling the
boundary conditions defined using n bits and
m constraints:
С(z) = ∑ Ca (z) ,
      </p>
      <p>a=1
where z – an n-bit string and Ca (z) = 1 if z
satisfies constraint a and 0 otherwise.</p>
      <p>
        Considering the representation of n bits by
n qubits, in [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] is presented the Quantum
Approximate Optimization Algorithm
(QAOA). It is shown in [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] that the QAOA
allows solving the problem in polynomial
time. The QAOA functionality are
implemented in the main QCE, such as Azure
Quantum, Cirq, Qiskit.
      </p>
    </sec>
    <sec id="sec-7">
      <title>Big data on transport</title>
      <p>
        First things first, we need to confirm that
big data methods are really that important in
modern transport area. Initially the sign of big
data was a set of 3 Vs: volume, velocity and
variety [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
      </p>
      <p>Even the basic analysis of today’s state of
transport is enough to say that it works with
big data:</p>
      <p>Volume. How it was stated before,
transport now is under a huge digitalization,
despite the fact that there is a lot to achieve
yet. Thanks to that, lots of new sources of data
were discovered. More sources mean more
data. Today every transportation machine is
equipped with tons of sensors, which data
needs analysis. And this is only a few
examples of data sources: data can be taken
from logistical systems, road sensors, CCTV
etc.</p>
      <p>Variety. Sources themselves became more
heterogeneous. Some stream bit data, some –
text data. There are sources with video and
audio data. It all depends on porpoise of
source and possibilities of application its data.</p>
      <p>Velocity. Modern data transmitted through
streams. To provide relevant processing and
analysis of data, systems must have enough
power. This concerns transport too, where
computation done in time can prevent delays
or even accidents.</p>
      <p>
        Some classifications add different signs of
big data, like veracity viability. One worth
mentioning is value [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. It denotes the
expediency of processing data for economical
purposes. In modern transport area
applicability of this sign is obvious, the correct
analysis of data can optimize technical and
logistical side of business, that can lead to
decrease in expenses.
      </p>
      <p>
        Big data processing opens a door to many
new services and upgradeability of old ones.
These are only few of them [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]:
      </p>
      <p>- Monitoring of infrastructure. With
bigger data amount, infrastructural analysis
becomes more accurate, resulting in more
effective management of infrastructure itself.</p>
      <p>- Increasing in mobility of services.
Today users need to have everything in their
hand – on their smartphone. Transport services
are no exception. Processing of big data grant
a possibility of providing services in a
useroriented way, also giving company additional
data, which can be useful in future.</p>
      <p>- Understanding client’s needs. One of
the most popular sources of big data – social
networks. Analyzing information from there
can give a lot of useful business-details. First
and foremost, this concerns client’s demands,
which is important on transport as on any other
area.</p>
      <p>- Human flow visualization. Visualization
is sometimes added to big data signs, which
stresses its importance. Indeed, this is very
powerful tool, that can solve a lot of tasks of
transport management, also being simple and
understandable to average person and not only
IT-experts.</p>
      <p>- Traffic control. This item speaks for
itself. More sources and data results in more
accurate prediction and more correct traffic
control.</p>
      <p>- Machine state diagnostics. This item is
especially relevant on the railroad, because
technical checkup and repairs are one of the
most important parts of transportation on train,
and they are not achievable without big data.</p>
      <p>
        It is worth to mention Smart Transport
initiative in a Smart City idea. The are many
definitions of Smart City, but for the sake of
simplicity let’s focus on that is a city, where
all of main components of infrastructure are
most intellectual, connected and efficient
because of IT usage [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ].
      </p>
      <p>
        The initiative itself implies
intellectualization of transport in the city,
including community transport and roads.
These are main aspects of Smart Transport
[
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]:
      </p>
      <p>- Smart Roads (changing road markings,
accident detection, smart lights, sensors
equipment).</p>
      <p>- Smart traffic lights (data analysis to
regulate traffic relatively to traffic density).</p>
      <p>- Smart cars (processing data from various
sources to provide autopilot and driver safety).</p>
      <p>- Smart road signs (analysis of data about
road state, sign changing).</p>
      <p>In the introduction to this article, the
problem of power of modern IT-systems is
concerned. One of the solutions to this is
quantum computers. Next, we give a short
specification of quantum computing and its
capabilities of processing big data.
7.</p>
    </sec>
    <sec id="sec-8">
      <title>Data</title>
    </sec>
    <sec id="sec-9">
      <title>Quantum computing and Big</title>
      <p>The main difference between quantum and
classical computing is a presence of two
physical phenomena, observed only in
microworld: quantum superposition and
entanglement.</p>
      <p>Quantum computers operate not in bits, like
classical PCs, but in qubits. The difference
between them is in the amount of their
possible states. Classical bit interprets the
presence or absence of electrical current and
can be either 0 or 1. Qubit interprets one of the
properties of a particle (for example electron’s
spin or photon’s polarization) and can not only
be ∣0⟩ or ∣1⟩, but in a state of superposition of
these values (d0∣0⟩+ d1∣1⟩), where d02 and d12 –
possibilities of qubit transition to that state.</p>
      <p>Quantum superposition phenomena is hard
to describe, because in classical physics there
are no suitable experimental examples. To put
it simply, superposition is a state, where qubit
is 0 and 1 at the same time. Unfortunately, this
phenomenon cannot be seen or felt by a
human. Every attempt to measure it results in
qubit collapsing in one of the states with
certain possibility. However, qubit in that state
still can be worked with.</p>
      <p>Its important to know, that qubit states are
written in brackets because they are actually
vectors. For example, vector ∣0⟩ can be written
like 1 and ∣1⟩ can be viewed as 0 .</p>
      <p>0 1</p>
      <p>Second distinctive feature of quantum
world – entanglement phenomena. Two or
more qubits can transit into one superposition
for all of them. Measurement of one of these
qubits will instantly collapse superposition not
only for it, but for every other entangled qubit.
All of them will transit into one prescribed
state. For example, if one will measure first
qubit in state (d0∣00⟩+ d1∣11⟩) and get 0, then it
certain, that second qubit is 0 too.</p>
      <p>Entanglement phenomena is used in
computations, but do not give any speedups. It
mostly usable for the quantum security. From
the other side, superposition can give that
necessary push in computer power for big data
processing.</p>
      <p>
        For example, we can consider two bits and
two qubits. Two bits can potentially turn into
one of four states (00, 01, 10, 11). But in this
moment in time two bits can represent only
one of these states. Two qubits can also transit
into one of these states plus their
superposition. This means two qubits can
represent in this moment in time all of these
sates at once [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ].
      </p>
      <p>This brings us to an ideal model of
quantum computing’s superiority over
classical computing, represented on Figure 1.</p>
      <p>We need to imagine some function and sets
of income data for it. The task is to get every
outcome value for every income. In classical
computing we need to run function for every
income value. In quantum computing, we can
set all income values into superposition and
run function only for this state. By this method
we can compute function only once, instead of
n.</p>
      <p>
        Of course, this model is very abstract and
everything is not so simple on practice. There
are many pitfalls, preventing this ideal course
of things. To show this, we can look at already
implemented on a real quantum computers
model – Grover’s algorithm of quantum search
[
        <xref ref-type="bibr" rid="ref31 ref32">31, 32</xref>
        ].
      </p>
    </sec>
    <sec id="sec-10">
      <title>Grover’s algorithm</title>
      <p>Detailed algorithm description is a separate
topic. This is a glimpse on principal of its
work. There is scheme of algorithm on Figure
2.</p>
      <p>The circuit consists of quantum gates –
orthogonal matrices, which apply to qubit
states with tensor product. Also, circuit has
oracle F – function, representing black box. It
is also a orthogonal matrix.</p>
      <p>This circuit is designed for two qubits.
There is a function f(x0,x1) and 4 possible
qubits states (∣00⟩, ∣01⟩, ∣10⟩, ∣11⟩). Function
returns 0 or 1, while returning 1 only for one
of possible states. We need to find this state.</p>
      <p>On circuit entrance two qubits being put in
state |00⟩ and one additional qubit in |1⟩ state.
Let’s observe two upper qubits. This pair goes
through Hadamard gate and transits into
superposition with equal possibilities for each
state. After oracle, one of the states changes its
operator to ‘-’. This is right state. To get the
answer, we need to increase its possibility and
decrease possibility of other states. For this,
superposition goes through A gate – a gate that
flips possibilities over average value. At the
end, needed state has possibility of 1, and any
other has 0.</p>
    </sec>
    <sec id="sec-11">
      <title>Quantum speedups</title>
      <p>Unfortunately, Grover’s algorithm won’t be
able to work so perfectly with 3 or more
qubits. In this situation, after possibilities flip,
the possibilities of wrong answers won’t go
into 0. This problem resolves by repeating the
circuit for out outcome data. Every time the
wrong possibilities will decrease.</p>
      <p>
        Grover himself computed a value of
needed repeats of algorithm for the most
believable answer. It is О(√ ) times [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. In
the other hand, classical algorithm needs О(n)
runs. Quantum algorithm gives a quadratic
speedup over the classical one. In theory,
classical search, running for 100 hours can be
run for 10 hours on quantum computer.
      </p>
      <p>Despite the dramatic decrease in time of
computing, for the average person tis speedup
may seem not so impressive. However, it
shows, that quantum technologies already can
be used in real tasks as more efficient way.</p>
      <p>
        It needs to be remembered, that quantum
computing is in its dawn and many things are
simply not yet discovered. Quantum
computing’s potential is well shown by Shor’s
algorithm [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]. This operation will take
minutes on quantum computer, while it takes
decades on classical.
      </p>
      <p>
        It is worth to mention a quantum machine
learning area. ML is vastly used in big data
analysis and its speedup would dramatically
affect this domain. On picture 3 there are few
ML methods, which potentially can be
accelerated by quantum computing [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. On
this scheme the theoretical speedups over
classical methods are given.
      </p>
      <p>As you can see some methods receive
exponential speedup. However, there is still a
lot work to do to get an actual value.
8.</p>
    </sec>
    <sec id="sec-12">
      <title>Conclusions</title>
      <p>An important difference between QCE and
ecosystems of classical computing is the large
role played by the scheme of quantum
elements in quantum computing.</p>
      <p>Various emulators of quantum computers
with support for emulation of different types
of noise are used for debugging.</p>
      <p>QCE contains the same basic modules as
classical computing ecosystems.</p>
      <p>Specific features of ECU:
- Quantum computing scheme development
environment.</p>
      <p>- A set of components for accessing a
quantum computer.</p>
      <p>- Emulator of quantum computer.
- Quantum computer.</p>
      <p>The QCE types by mode of development:
1. On advanced classical computing
ecosystems basing such as Microsoft and
Google.</p>
      <p>2. Completely newly developed systems
such as IBM and Rigetti.</p>
      <p>3. Some QCE collect a variety of services:
software libraries, emulators and quantum
computers, for example, Strangeworks.</p>
      <p>In terms of application, Google QCE is
distinguished, containing a developed toolkit
of the machine learning system TensorFlow
Quantum.</p>
      <p>Google, Azure Quantum, IBM and Rigetti
QCE can be used for training purposes,
providing a convenient user interface and
advanced documentation with examples.</p>
      <p>
        It is proposed to consider as promising
tasks for further research on the possibilities of
using quantum computing ecosystems:
- applied use of QAOA [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] for solving
problems of transport logistics optimization;
- machine learning tasks for monitoring the
characteristics of cyber-physical systems and
assessing the quality of IT services [
        <xref ref-type="bibr" rid="ref35 ref36 ref37">35-37</xref>
        ];
- problems of integrating tools for
processing big data and neural networks for
the classification of images and complex
objects [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kung и M. Fancy</surname>
          </string-name>
          , «
          <string-name>
            <given-names>A Quantum</given-names>
            <surname>Revolution</surname>
          </string-name>
          <article-title>: Report on global policies for quantum technology»</article-title>
          . Available: https:// cifar.ca/wp-content/uploads/2021/05/ QuantumReport-EN-May2021.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Arute</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Arya</surname>
          </string-name>
          , R. Babbush и e. al, «
          <article-title>Quantum supremacy using a programmable superconducting processor»</article-title>
          <source>Nature</source>
          , pp.
          <volume>504</volume>
          ,
          <fpage>505</fpage>
          -
          <lpage>510</lpage>
          , 24 октябрь
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Pednault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gunnels</surname>
          </string-name>
          , D. Maslov и J.Gambetta, «On “Quantum Supremacy”»
          <year>2019</year>
          .https://www.ibm.com/blogs/researc h /
          <year>2019</year>
          /10/on-quantum-supremacy/.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Preskill</surname>
          </string-name>
          , «
          <article-title>Quantum computing in the NISQ era and beyound» Quantum, т</article-title>
          .
          <volume>2</volume>
          :
          <issue>79</issue>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Andreev</surname>
          </string-name>
          , [etc], «
          <article-title>Quantum model of computing from a classical programmer point of view» Preprints</article-title>
          . Keldysh Institute of Applied Mathematics., v.
          <volume>178</volume>
          , p.
          <fpage>30</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Tansley</surname>
            ,
            <given-names>A.G.</given-names>
          </string-name>
          <article-title>The use and abusec of vegetational concepts and terms / A</article-title>
          .G. Tansley. Ecology.
          <year>1935</year>
          . Vol.
          <volume>16</volume>
          . No 3. P.
          <volume>284</volume>
          -
          <fpage>307</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>D.G.</surname>
          </string-name>
          <article-title>Messerschmitt и C. Szyperski, Software ecosystem: understanding an indispensable technology and industry</article-title>
          , Cambridge, Mass.: MIT Press,
          <year>2003</year>
          . 424 p.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8] JetBrains, «Software development ecosystems»
          <year>2020</year>
          . Available: https://www.jetbrains.com/lp/devecosyste m-2020/.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>[9] «Overview of the state of Microsoft Software development ecosystem</article-title>
          <year>2020</year>
          »
          <year>2021</year>
          . Available: https://dev.to/endbird/ overview
          <article-title>-of-the-state-of-microsoftsoftware-development-</article-title>
          <string-name>
            <surname>ecosystem-</surname>
          </string-name>
          2020
          <source>- 6j6.</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10] «Google quantum» Google,
          <year>2021</year>
          . Available: https://quantumai.google/.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>«IBM Quantum»</surname>
            <given-names>IBM</given-names>
          </string-name>
          ,
          <year>2021</year>
          . Available: https://quantum-computing.ibm.com/.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>[12] «Rigetti»: https://www.rigetti.com/what.</mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>[13] «Quil» https://github.com/quil-lang/quil.</mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14] «Azure Quantum» Microsoft,
          <year>2021</year>
          . Available: https://azure.microsoft.com/ruru/solutions/quantum-computing/.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15] «Оverview azure quantum» https://github.com/MicrosoftDocs/quantu m-docs/blob/main/articles/overviewazure-quantum.
          <source>md.</source>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>[16] «Amazon Braket» Amazon, Available: https://aws.amazon.com/ru/braket/.</mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <source>[17] «Reinventing Data Processing with Quantum Computing» Intel</source>
          , Available: https://www.intel.com/content/www/us/e n/research/quantum-computing.html.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>[18] «Strangeworks» https://strangeworks.com/</mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>[19] «IonQ,» Available: https://ionq.com/.</mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>K.</given-names>
            <surname>Wehden</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Faro и J. Gambetta, «IBM's roadmap for building an open quantum software ecosystem» 04 February 2021</article-title>
          . https://www.ibm.com/blogs/research/202 1/02/quantum-development-roadmap/. https://www.ibm.com/blogs/research/202 1/02/quantum-development-roadmap/.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>A. I.</given-names>
            <surname>Torre-Bastida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Ser</surname>
          </string-name>
          , I. Laña,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ilardia</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. N.</surname>
          </string-name>
          <article-title>Bilbao и S. CamposCordobés, «Big Data for transportation and mobility: recent advances, trends</article-title>
          and challenges,
          <source>» IET, т. 12</source>
          , pp.
          <fpage>742</fpage>
          -
          <lpage>755</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Cormen</surname>
          </string-name>
          , Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.;
          <string-name>
            <surname>Stein</surname>
          </string-name>
          , Clifford. «Introduction to Algorithms». 3rd. MIT Press,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>E. Farhi и J.</given-names>
            <surname>Goldstone</surname>
          </string-name>
          , «
          <string-name>
            <given-names>A Quantum</given-names>
            <surname>Approximate Optimization Algorithm</surname>
          </string-name>
          »
          <year>2014</year>
          . https://arxiv.org/abs/1411.4028.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>B.</given-names>
            <surname>Mansouri</surname>
          </string-name>
          , «
          <article-title>An Analysis of the Quantum Approximation Optimization Algorithm» 23 March 2021</article-title>
          . Available: https://arxiv.org/pdf/2103.12791.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Laney</surname>
            <given-names>D.</given-names>
          </string-name>
          et al.
          <article-title>3D data management: Controlling data volume, velocity and variety</article-title>
          .
          <source>META group research note</source>
          .
          <year>2001</year>
          . V.
          <article-title>6</article-title>
          . No. 70. P.
          <volume>1</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Chen</surname>
            <given-names>M.</given-names>
          </string-name>
          et al.
          <article-title>Big data: related technologies, challenges and future prospects</article-title>
          . Heidelberg : Springer,
          <year>2014</year>
          . V.
          <volume>96</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Torre-Bastida</surname>
            <given-names>A. I.</given-names>
          </string-name>
          et al.
          <article-title>Big Data for transportation and mobility: recent advances, trends and challenges</article-title>
          .
          <source>IET Intelligent Transport Systems</source>
          .
          <year>2018</year>
          . V.
          <volume>12</volume>
          . No.
          <issue>8</issue>
          . Pp.
          <volume>742</volume>
          -
          <fpage>755</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Nam</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pardo</surname>
            <given-names>T. A.</given-names>
          </string-name>
          <article-title>Conceptualizing smart city with dimensions of technology, people, and institutions //Proceedings of the 12th annual international digital government research conference: digital government innovation in challenging times</article-title>
          .
          <year>2011</year>
          . Pp.
          <volume>282</volume>
          -
          <fpage>291</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Chris</surname>
            <given-names>Bernhardt.</given-names>
          </string-name>
          (
          <year>2019</year>
          ),
          <article-title>Quantum Computing for Everyone</article-title>
          . The MIT Press. Cambridge, Massachusetts, London, England.
          <year>2019</year>
          . 214 p.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Pandey</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramesh</surname>
            <given-names>V</given-names>
          </string-name>
          .
          <article-title>Quantum computing for big data analysis</article-title>
          .
          <source>Indian Journal of Science</source>
          .
          <year>2015</year>
          . Т.
          <volume>14</volume>
          . No.
          <issue>43</issue>
          . Pp.
          <volume>98</volume>
          -
          <fpage>104</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Figgatt</surname>
            <given-names>C.</given-names>
          </string-name>
          et al.
          <article-title>Complete 3-qubit Grover search on a programmable quantum computer</article-title>
          .
          <source>Nature communications</source>
          .
          <year>2017</year>
          . V.
          <article-title>8</article-title>
          . No 1. Pp.
          <volume>1</volume>
          -
          <fpage>9</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Grover</surname>
            <given-names>L. K.</given-names>
          </string-name>
          <article-title>A fast quantum mechanical algorithm for database search</article-title>
          .
          <source>Proceedings of the twenty-eighth annual ACM symposium on Theory of computing</source>
          .
          <year>1996</year>
          . Pp.
          <volume>212</volume>
          -
          <fpage>219</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Shor</surname>
            <given-names>P. W.</given-names>
          </string-name>
          <article-title>Algorithms for quantum computation: discrete logarithms and factoring</article-title>
          .
          <source>Proceedings 35th annual symposium on foundations of computer science. IEEE</source>
          ,
          <year>1994</year>
          . Pp.
          <volume>124</volume>
          -
          <fpage>134</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Biamonte</surname>
            <given-names>J.</given-names>
          </string-name>
          et al.
          <article-title>Quantum machine learning</article-title>
          .
          <source>Nature</source>
          .
          <year>2017</year>
          . V.
          <volume>549</volume>
          . No 7671.
          <string-name>
            <surname>Pp</surname>
          </string-name>
          .
          <volume>195</volume>
          -
          <fpage>202</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <surname>Maksim</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Bolshakov</surname>
          </string-name>
          , Igor A.
          <string-name>
            <surname>Molodkin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Sergei</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Pugachev</surname>
          </string-name>
          .
          <article-title>Comparative analysis of machine learning methods to assess the quality of IT services</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          . Vol.
          <volume>2803</volume>
          , pp.
          <fpage>142</fpage>
          -
          <lpage>149</lpage>
          . http://ceur-ws.org/Vol2803/paper20.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>Lokhvitskii</surname>
            ,
            <given-names>V.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khomonenko</surname>
            ,
            <given-names>A.D.</given-names>
          </string-name>
          ,
          <article-title>Bol'shakov, M.A. On the Construction of a Cybervisor for the Intelligent Monitoring and Control of Data Centers</article-title>
          .
          <source>Automatic Control and Computer Sciences</source>
          ,
          <year>2019</year>
          ,
          <volume>53</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>870</fpage>
          -
          <lpage>873</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <surname>Shardakov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bubnov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kornienko</surname>
            ,
            <given-names>S. Modeling</given-names>
          </string-name>
          <article-title>the operation of a distributed high-load monitoring system for a data transmission network in a non-stationary mode</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          , v.
          <volume>2803</volume>
          , pp.
          <fpage>107</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <surname>Kosykh</surname>
            ,
            <given-names>N.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khomonenko</surname>
            ,
            <given-names>A.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bochkov</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kikot</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          (
          <year>2020</year>
          ),
          <article-title>Integration of big data processing tools and neural networks for image classification</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          , Vol.
          <volume>2556</volume>
          , pp.
          <fpage>52</fpage>
          -
          <lpage>58</lpage>
          . http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2556</volume>
          /paper9.pdf.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>