Skip to main content

Quantum Memories in Free Space

 

 

 In quantum technologies, the important point is to be able to transmit the information-carrying quantum bits (qubits) from the transmitter to the receiver without loss or damage. This is one of the main purposes. For this, physicists are developing quantum memories that allow us to store information-loaded photons for certain periods of time to be transmitted at any time. Quantum memories are essential components for applications such as quantum information processing, quantum networks, and quantum repeaters.

There are quantum devices developed by various methods in order not to lose photons or disrupt their function during the storage process of qubits. In today's article, I will talk about an alternative approach besides the material quantum memories produced.

Scientists from the University of Illinois Urbana-Champaign, Truman State University, and RightHand Robotics, Inc. have succeeded in producing a quantum memory in free space. Before describing quantum memories operating in free space, let's talk about their counterparts in the literature.

One of them is item memories. Matter memories involve the conversion of photons into electronic or spin states of a cloud or atomic lattice, offering the storage and release of photons within a specified storage time range and potentially high accuracy. However, these memories have the disadvantages of operating at extremely high or low temperatures and storing a narrow wavelength, which reduces efficiency and increases cost. Another example of our type of memory is 'delay line memories'. Delay line memories, unlike matter memories, do not convert photons to a different state, but instead add a fiber optic cable to the system, delaying the photon's arrival by a time determined by the distance of travel (and the refractive index of the delay line material). This approach is inexpensive and simple in terms of cost but includes a few features. For example, the latency of the fiber cannot be changed by a significant amount. Fiber delays eliminate the costly overhead of item memories and the strict wavelength bandwidth, but they still have a low loss in a given wavelength band only.

Upon minimizing these barriers, our researchers developed a memory type based on the idea of delay line memories. This new quantum memory stores photons in a series of multiplexed empty spaces instead of storing them in a fiber. The manufactured memory is constructed with three multiplexed optical delay lines that can be sequentially switched with varying storage times (12.5 ns, 125 ns, and 1.25 µs) to achieve the optimum balance of storage time and efficiency. In addition, the memory allows us to avoid fiber losses and DOF limitations by operating in free space at room temperature, not requiring the high costs of matter memories.

Quantum memories that we can store in free space seem to allow for more robust, high-performance use in some quantum information processing protocols. If you want to have more detailed and technical information, you can reach the article in the references section.


Stay with physics.



Reference

Nathan T. Arnold, Michelle Victora, Michael E. Goggin, Paul G. Kwiat, "Free-
space photonic quantum memory," Proc. SPIE 12446, Quantum Computing,
Communication, and Simulation III, 1244606 (8 March 2023); 

doi: 10.1117/12.2649350

Labels:

Comments

Post a Comment

Popular posts from this blog

Bloch Sphere – Geometric Representation of Quantum State

    It is very difficult to visualize quantum states before our eyes. The Bloch sphere represents quantum state functions quite well. The Bloch sphere is named after physicist Felix Bloch. As you can see in the Bloch sphere figure below, it geometrically shows the pure states of two-level quantum mechanical systems. The poles of the Bloch sphere consist of bits |0⟩ and |1⟩. Classically, the point on the sphere indicates either 0 or 1. However, from a quantum mechanics point of view, quantum bits contain possibilities to be found on the entire surface of the sphere. Traditionally, the z-axis represents the |0⟩ qubit, and the z-axis the |1⟩ qubit. When the wave function in superposition is measured, the state function collapses to one of the two poles no matter where it is on the sphere. The probability of collapsing into either pole depends on which pole the vector representing the qubit is closest to. The angle θ that the vector makes with the z-axis determines this probabilit...
1 comment
Read more

Statement of Bell's Inequality

 One of the most important applications of quantum mechanics is Bell's inequality. In 1965, John Stewart Bell actually thought that Einstein might be right and tried to prove it, but proved that quantum logic violated classical logic. It was a revolutionary discovery. Let's look at its mathematically simple explanation. To create the analogy, let's first write a classical inequality.   This inequality above is a classic expression. The quantum analogy of this expression represents the Bell inequality. With just one difference. Bell's inequality shows that the above equation is violated. Expressing Bell's inequality by skipping some complicated mathematical intermediates; While there is no such situation in the classical world that will violate the inequality we mentioned at the beginning, it is difficult to find a situation that does not violate this inequality in the quantum world. Reference https://www.youtube.com/watch?v=lMyWl6Pq904 https://slideplay...
1 comment
Read more

Bernstein–Vazirani Algorithm

  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...
Post a Comment
Read more