Join Psiket webinars to hear from experts and explore the latest ideas and breakthroughs in quantum science—live, clear, and practical.

Quantum teleportation is one of the fundamental protocols in quantum information science. It enables the transfer of unknown quantum states without physically transporting the system carrying them, by exploiting entanglement and classical communication. Among the various approaches, continuous-variable quantum teleportation offers significant experimental advantages due to its compatibility with conventional optical and telecommunications equipment. However, achieving high fidelity remains one of its major challenges. This presentation aims to introduce an approach to improving teleportation performance by increasing both fidelity and success probability. To this end, using a scheme based on multimode interference and three-dimensional entangled resources, continuous-variable quantum teleportation is decomposed into a set of discrete-variable teleportation processes. Furthermore, since noise is one of the fundamental challenges in implementing quantum protocols under real-world conditions, the performance of the proposed scheme is systematically investigated in the presence of three types of quantum noise channels. The results show that this method not only improves teleportation fidelity and success probability but also demonstrates acceptable robustness against the noise types considered. These findings may contribute to identifying strategies for enhancing the performance and robustness of quantum teleportation protocols under non-ideal conditions

“If a quantum computer can break Bitcoin’s cryptography, what will happen to trillions of dollars in digital assets?” The development of cryptography in the twentieth century introduced new prospects and applications across various industries. One notable example is the design of Bitcoin in 2008 as the first widely adopted cryptocurrency. Having had a significant impact on the financial industry, the cryptocurrency market today is worth several trillion dollars. Cryptocurrency transactions are generally based on public-key cryptography, specifically digital signature protocols. For example, Bitcoin uses the elliptic-curve digital signature algorithm based on secp256k1. Therefore, the security of transactions and, consequently, the entire ecosystem relies on the computational complexity of solving problems such as the discrete logarithm problem and integer factorization. This security is challenged by the development of quantum algorithms, such as Shor’s algorithm, alongside the advancement of quantum computers capable of executing these algorithms with large numbers of qubits. Since their introduction in 2008, cryptocurrencies have become an important part of the global financial system, with their market value reaching trillions of dollars. The emergence of powerful quantum computers could challenge the security and stability of this vast ecosystem, potentially triggering an international financial crisis. It is therefore essential to estimate how and when quantum computing and quantum computers could compromise the security of current protocols, as well as to identify alternative solutions to preserve cryptocurrency security once quantum computing reaches the required level of processing power. In this presentation, after introducing the Bitcoin protocol as an example, we will examine the challenges that the development of quantum computers could pose to the security of cryptocurrencies. We will discuss the number of qubits and the time required to break existing protocols, and review potential solutions, including the use of post-quantum cryptographic algorithms, to secure cryptocurrencies in the post-quantum era.

What if someone tried to read your message while it was being transmitted—and you could detect it immediately? This is exactly the idea behind “quantum secure communication,” which we will explore in this webinar.

This talk explores the major frontiers of the Second Quantum Revolution from a quantum hardware perspective, focusing on how the future of quantum technologies will be shaped. I present a forward-looking view of how the three foundational pillars—quantum computation, quantum communication, and quantum sensing—are co-evolving toward scalable and practically deployable quantum infrastructures. Within this framework, I highlight selected examples from my own work, including spin–photon interfaces in silicon for scalable quantum computing architectures and quantum networking, erbium-doped nanoparticle single-photon sources for telecom-band quantum communication, and a levitated superconducting particle coupled to a superconducting qubit as a platform for macroscopic quantum control and ultra-sensitive quantum sensing.

In this talk, we begin by introducing a general framework for quantifying the intrinsic quantum randomness. This framework allows us to compute the maximum guessing power of an eavesdropper, while fully accounting for the possibility that they may share classical or quantum correlations with the input state or even with the measurement itself. We then compute the intrinsic randomness of a mixed state and identify the measurements that optimize this quantity. Next, we derive the randomness generated by noisy measurements, along with the corresponding optimal states. Finally, we show that the simultaneous presence of noise in both the state and the measurement can significantly enhance the eavesdropper’s ability to guess the outcomes.

In this webinar, Dr. Morteza Moradi discusses the topic “Quantum Channels and How to Retrieve Information After Passing Through Them.” The subject of the webinar is related to quantum communications, providing a general introduction to quantum channels. If you are interested in quantum communication and quantum cryptography, this webinar is for you.

Although quantum cryptography offers extremely high security, it still faces two major challenges: transmission distance and quantum key rate. To improve this technology, we must employ powerful theoretical and computational tools—one of which is tensor networks, particularly the Multi-scale Entanglement Renormalization Ansatz (MERA) architecture. MERA provides an efficient structure for the optimal encoding of quantum states of matter, especially in critical states. In this seminar, we will demonstrate how MERA can serve as a novel mathematical and algorithmic language, opening new horizons in quantum cryptography. Finally, we will discuss the role of trapped-ion systems as one of the leading experimental platforms for implementing such networks.

For the design and engineering of efficient quantum systems, accurate estimation of the key parameters of quantum channels is of paramount importance. In this presentation, we employ the method of adaptive quantum estimation to achieve the maximum possible precision in estimating these parameters. By leveraging adaptive mechanisms, this approach progressively improves the accuracy of the estimates, bringing them closer to the ultimate precision bounds set by quantum mechanics. To this end, we utilize an adaptive protocol with local operations and two-way classical communication, in combination with the teleportation-stretching technique and quantum estimation theory. Furthermore, a mathematical simulation of the quantum channel is performed to validate and analyze the effectiveness of the proposed method.

Device-independent scenarios represent a fundamental shift in quantum information theory that enables the implementation of secure and verifiable quantum protocols without relying on the internal details of devices. This approach is based on Bell nonlocality, whereby violation of Bell inequality is used to ensure properties such as entanglement, randomness, and cryptographic security. This concept has wide applications in quantum cryptography, quantum random number generation, self-testing, quantum computation, and quantum networks. In device-independent quantum cryptography, the security of exchanged keys is guaranteed solely based on the violation of the inequality, without the need to know the internal workings of the sender and receiver. In the field of random numbers, this method allows for the generation of verifiable quantum random numbers that remain unpredictable even in the presence of a spy controlling the devices. Another key aspect of device-independent scenarios is self-testing, which allows us to verify quantum states and measurements based solely on observed data. This feature facilitates the verification of entanglement sources in quantum networks and plays an important role in the development of quantum-secure hardware. Despite the theoretical and practical importance of device-independent scenarios, the experimental implementation of these protocols faces challenges, including detection limitations, noise, and experimental holes that can weaken non-local correlations. However, recent advances have brought these applications closer to reality. In this presentation, a comprehensive picture of device-independent scenarios from theoretical foundations to advanced applications in quantum cryptography, random number generation, and quantum networks is presented.