Everyone in the IT world is wondering how big a threat quantum computers pose to cryptography and how to deal with the problem. This series of articles tries to explain the problem in a popular way. After explanation of quantum computer attack it is appropriate to understand how quantum computers actually work.
These are sophisticated devices that usually use extremely low temperatures to achieve the necessary state of matter, with the exception of photonic quantum computers. In order to work with it, it is necessary to perform seemingly contradictory steps, to limit its energy and at the same time bring it into an excited state. The goal is to create isolated islands in which three basic properties of the quantum world can manifest themselves. These are superposition, entanglement and interference. Such an island (qbit) can achieve all possible states in the case of superposition, i.e. logical 1, logical 0 and everything in between. If there are more qbits, these two points can simultaneously contain the values 00, 01, 10 and 11. In addition to these states, specific states can of course also contain indeterminate states, i.e., in simple terms, everything between 00 and 11. It is possible to continue in the same way. The states are probabilistic, they can interfere with each other, i.e., act on each other. The result of the calculation can only be determined by measurement.
Unlike a classical computer, where each bit contains one value, a qbit contains both. As a result, to store 256 bits during a calculation, we need 256 digital bits on a digital computer, but only 8 qbits. It is this principle, going through all the possibilities, that enables the extreme computing power provided by quantum computers. At the same time, it is a certain disadvantage, because due to the probabilistic nature of the calculation, it is necessary to repeat it several times.
Although we currently call it a quantum computer, this is not entirely accurate. These computers are more like field-programmable gate arrays (FPGAs) that are programmed for specific requirements. At the moment, it is not possible to enter parameters directly as part of the program and it is necessary to provide this data by setting the circuit structure. This allows us to imagine the calculation as a series of waves, more precisely a probability wave, that passes through the circuit. The circuit will allow some waves to pass through and amplify their result, and will not allow others to pass through.
How do we actually imagine the behavior of an individual qubit? From computers, we are used to a bit that has specific values of 0 or 1, nothing in between. On or off. But when working with qubits, this does not apply. The state of a qubit can be imagined as the surface of a globe. There is a one at the south pole, a zero at the north pole. During the calculation, the value can be anywhere on the surface, but when measured, it "falls" to the north or south pole. Similarly, particles can have an orientation in one of the x, y or z axes, which again points to the surface of the globe, i.e. any place. However, the descriptions given are just different views of the same matter from a computer science, mathematical and physical point of view.>
In quantum computers, it is possible to encounter single-qubit gates, such as Hadamard (H), Pauli gates (X, Y, Z), qubit rotation. Then there are two-qubit gates, mainly CNOT, CZ, iSWAP and others. Their speeds depend on the technology used and they can be roughly distinguished as follows.
| Technology | Single-qubit | Two-qubit | Comment |
| Superconducting qubits | 10–50 ns | 100–400 ns | Very fast, shorter coherence |
| Ion traps | 1–10 µs | 50–300 µs | Slower, extremely accurate |
| Neutral atoms | 0.5–5 µs | 1–10 µs | Good scalability |
| Photonic qubits | ~ps–ns | probability | Fast, heavy interaction |
| Topological qubits (theoretical) | ON | ON | Experimental |
The theoretical upper limit of the switching speed of quantum gates (QSL – Quantum Speed Limit) should be in the order of picoseconds to tens of femtoseconds, i.e. in the range of 10-12 s to 10-14 s. Current technologies are approximately 4-8 orders of magnitude slower. Furthermore, there is a difference between the calculation speed in a quantum processor and the speed of information propagation (the interaction time, for example, the propagation of a microwave signal ensuring this interaction). In our universe, this cannot exceed the speed of light. It sounds a bit absurd, but the propagation of information ensuring setting the qubits to the desired state is limited. The next time is taken by the change (changing the orientation in Hilbert space), this time is again minimal. But what takes up the most time is the control electronics (1-10µs) and quantum correction codes. But the vast cooperation on the probabilistic calculation takes place (with the exception of the mentioned delays) thanks to the laws of the quantum world practically instantly.
Explanation of the delay on QEC and control electronics:
If several physical qubits form one logical one, it is necessary
to be aware of the dependencies between the QEC cycles (Quantum
Error Correction, 0.5-2 µs) and the corresponding error corrections
at the logical qubit level. Measuring and decoding errors takes
approximately 1-50 µs. Only then is it possible to process the logical
qubit (built thanks to QEC over several physical ones) on the gate,
where the resulting logical gate has a speed of roughly 10-200 µs.
Note that the logical, not the physical, qubit is processed. The gate
can therefore have a "speed" of around 100 µs. The electronics
themselves create additional delays. First, it is a control, currently
usually on FPGA (< 10 µs). In addition, signal generation, when
using microwaves, requires another ~1 µs and a readout (decision)
of approximately 10 µs. The speed of the gates is therefore greatly
simplified in the example.
To be continued in the next section Shor's Algorithm (March 16th 2026)
1. Introductory Provisions
1.1. These General Terms and Conditions are, unless otherwise agreed in writing in the contract, an integral part of all contracts relating to training organised or provided by the trainer, Jan Dušátko, IČ 434 797 66, DIČ 7208253041, with location Pod Harfou 938/58, Praha 9 (next as a „lector“).2. Creation of a contract by signing up for a course
2.1. Application means unilateral action of the client addressed to the trainer through a data box with identification euxesuf, e-mailu with address register@cryptosession.cz or register@cryptosession.info, internet pages cryptosession.cz, cryptosession.info or contact phone +420 602 427 840.3. Termination of the contract by cancellation of the application
3.1. The application may be cancelled by the ordering party via e-mail or via a data mailbox.4. Price and payment terms
4.1. By sending the application, the ordering party accepts the contract price (hereinafter referred to as the participation fee) indicated for the course.5. Training conditions
5.1. The trainer is obliged to inform the client 14 days in advance of the location and time of the training, including the start and end dates of the daily programme.6. Complaints
6.1. If the participant is grossly dissatisfied with the course, the trainer is informed of this information.7. Copyright of the provided materials
7.1. The training materials provided by the trainer in the course of the training meet the characteristics of a copyrighted work in accordance with Czech Act No 121/2000 Coll.8. Liability
8.1. The trainer does not assume responsibility for any shortcomings in the services of any third party that he uses in the training.9. Validity of the Terms
9.1 These General Terms and Conditions shall be valid and effective from 1 October 2024.Consent to the collection and processing of personal data
According to Regulation (EU) No 2016/679 of the European Parliament and of the Council on the protection of individuals with regard to the processing of personal data and on the free movement of such data and repealing Directive 95/46/EC (General Data Protection Regulation, hereinafter referred to as "the Regulation"), the processor xxx (hereinafter referred to as "the Controller") processes personal data. Individual personal data that are part of the processing during specific activities at this web presentation and in the course of trade are also broken down.Information about the records of access to the web presentation
This website does not collect any cookies. The site does not use any analytical scripts of third parties (social networks, cloud providers). For these reasons, an option is also offered for displaying the map in the form of a link, where the primary source is OpenStreet and alternatives then the frequently used Maps of Seznam, a.s., or Google Maps of Google LLC Inc. The use of any of these sources is entirely at the discretion of the users of this site. The administrator is not responsible for the collection of data carried out by these companies, does not provide them with data about users and does not cooperate on the collection of data.Information about contacting the operator of the site
The form for contacting the operator of the site (administrator) contains the following personal data: name, surname, e-mail. These data are intended only for this communication, corresponding to the address of the user and are kept for the time necessary to fulfil the purpose, up to a maximum of one year, unless the user determines otherwise.Information about the order form
In case of an interest in the order form, the form contains more data, i.e. name, surname, e-mail and contact details for the organisation. These data are intended only for this communication, corresponding to the address of the user and are kept for one year, unless the user determines otherwise. In the event that a business relationship is concluded on the basis of this order, only the information required by Czech law on the basis of business relations (company name and address, bank account number, type of course and its price) will continue to be kept by the administrator.Information about the course completion document
Within the course, a course completion document is issued by the processor. This document contains the following data: student's name and surname, the name and date of the course completion and the employer's name. The information is subsequently used for the creation of a linear hash tree (non-modifiable record). This database contains only information about the provided names and company names, which may or may not correspond to reality and is maintained by the processor for possible re-issuance or verification of the document's issuance.Rights of the personal data subject
The customer or visitor of this website has the possibility to request information about the processing of personal data, the right to request access to personal data, or the right to request the correction or deletion of any data held about him. In the case of deletion, this requirement cannot be fulfilled only if it is not data strictly necessary in the course of business. The customer or visitor of this website also has the right to obtain explanations regarding the processing of his personal data if he finds out or believes that the processing is carried out in violation of the protection of his private and personal life or in violation of applicable legislation, and the right to request removal of the resulting situation and to ensure the correction.