Era Quantic | Quantum Computing and Information Articles

  In recent years, quantum computing has emerged as a revolutionary field with the potential to solve complex problems that were previously considered intractable. Among the various types of quantum computers, superconducting quantum computers have gained significant attention due to their scalability, stability, and promising computational capabilities. This article delves into the world of superconducting quantum computers, exploring their underlying principles, technological advancements, and the impact they are likely to have on various industries. Understanding Quantum Computing: Quantum computers leverage the principles of quantum mechanics, a branch of physics that describes the behavior of matter and energy at a microscopic level. Unlike classical computers that use bits to represent information as zeros and ones, quantum computers employ quantum bits, or qubits, which can exist in multiple states simultaneously thanks to a phenomenon known as superpositio...

  Photonics quantum computers are a rapidly developing field of research that aims to harness the properties of photons, the fundamental particles of light, for quantum information processing. Quantum computing is a revolutionary paradigm that exploits the principles of quantum mechanics to perform computations that are infeasible for classical computers. Photonic quantum computers offer several advantages over other implementations, such as high-speed operations, long-distance entanglement, and the ability to manipulate and transport quantum information with minimal decoherence. Principles of Photonics Quantum Computers: Photonics quantum computers operate based on two fundamental principles of quantum mechanics: superposition and entanglement. Superposition allows quantum bits or qubits, the basic units of quantum information, to exist in multiple states simultaneously, enabling parallel computations. Entanglement, on the other hand, establishes a correlation between...

  To date, we have quantum computers that are superconducting, ion-trapped, neutral atoms, and photons. However, it seems that a new one will be added among these types. Phonons could be popular for this new quantum computer. Before moving on to this stage, a team led by Prof. Andrew Cleland at the Pritzker School of Molecular Engineering at the University of Chicago conducted two experiments to establish a detailed study of phonons. As is known, quantum mechanics argues that quantum elementary particles are indivisible. For example, photons, the smallest particles of light with which we are more studied and familiar, are examples of these elementary particles. However, little attention has been paid to phonons, another quantum particle that transmits sound, in small packets. The team at the University of Chicago was able to figure out how to first capture single phonons and entangle two phonons, using phonons with a pitch that is about a million times higher than what the human ea...

    Finally, we have come to the famous Shor's definition of the algorithm in this article. Before applying this algorithm, we examined in detail the three mathematical operations required for our algorithm. These three necessary mathematical expressions were modular arithmetics, quantum Fourier transform , and quantum phase estimation . As you may remember, Shor's algorithm is an algorithm that gives prime factor values of large numbers. To show that this protocol works, we will write an algorithm that gives the prime factors of 15. The binary equivalent of the decimal number 15 consists of 1111 qubits. Now let's examine Shor's protocol in detail. If we write it in a regular way, we can write the state vector | ψ 3 > as follows. Now, let's measure the last four qubits. In this case, we would have measured the situations |1>, |2>, |4>, |8> with 25% probability. Suppose we have reached the state |8> with a probability of 25% in our measurement re...

  In my previous article, I wrote an introduction to quantum phase estimation and explained the working principle of a quantum circuit for a single qubit. As I mentioned before, in order to obtain the quantum phase precisely, we will either repeat our algorithm continuously or find a precise quantum phase in one goes using multiple qubits. The most logical solution is to create our quantum circuit with many qubits. So let's look at the details of our quantum circuit! This may remind you of the quantum Fourier transform . Yes, it's definitely a good guess. In the last step, if we apply the inverse quantum Fourier transform and measure, we will probably get the 2nϕ phase. Using multiple qubits, we found our quantum phase. We can now apply it to its important application, Shor's algorithm. Stay curious. :)           Reference https://www.youtube.com/watch?v=PhhsGb-pY94&list=PLqNc_xpYGu775P7iJA7Kvfxmv_Fm9wwHj&index=14

    We continue our series of fundamental and ongoing quantum algorithms. In today's post, we'll look at the eigenvalue calculation that is familiar to anyone in both the basic sciences and engineering. We will consider a slightly different situation, of course, our work is quantum. Let's consider the quantum state of a system! When we make an observation, we obtain real observation values by calculating the eigenvalues and eigenvectors of the state in that system, the mathematical calculation that helps us to have information about the position, momentum, or energy of that system. So, how can we find the eigenvalues of the unitary operators, which act on a system without changing its size, that is, preserve its physical size? To solve this problem, we will examine the Quantum Phase Estimation solution. In order to find the eigenvalues of the unit operator U, we need to find the value of the phase ϕ, which is inside the exponential value. However, it is not that easy. A qua...

  Quantum computers currently available are not sufficient to solve every existing classical problem due to their own characteristics. This does not mean that they are inferior to classical computers, or that, on the contrary, quantum computers should give all kinds of advantages over classical computers. Popular quantum algorithms solved in quantum computers are algorithms created by taking advantage of the superposition and entanglement properties of particles. So, they are algorithms created to show the prominent features of quantum properties. Today I will talk about an enjoyable algorithm that demonstrates the efficiency and speed of these quantum features. Known as the Bernstein - Vazirani algorithm is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1992. The purpose of this algorithm, which is a game, is to find a desired number. To put it more clearly, let's keep in mind a string of binary numbers, for example, 1011001. Next, let's write an algori...