In conventional logic gate-based quantum computing, qubits have specific functions but require cryogenic temperatures. quantum annealing-based quantum computing faces challenges like decoherence and non-adiabatic tran...
详细信息
quantum circuit simulations are essential for the verification of quantumalgorithms on behalf of real quantum devices. However, the memory requirements for such simulations grow exponentially with the number of qubit...
详细信息
The proliferation of digital devices like smartphones and the Internet of Things has resulted in a flood of data. Every second, millions of bytes of data (including text, music, images, and videos) are produced. Thus,...
详细信息
Facial Attendance Tracker is a mobile application where a student can fetch his/her attendance by scanning his/her face from his/her own mobile. The faculty will project the Dynamic QR code when he/she wants to take t...
详细信息
quantum machine learning is a process by which quantum computers are used to learn from data. It is still in its begining stages of development, but has the potential to be much more efficient than classical machine l...
详细信息
In their recent paper, Ramezani et al. [Phys. Rev. A 108, 052405 (2023)] presented a quantum multiplication algorithm with O(Nlog2(N)) operations, while the best classical algorithm [Harvey and van der Hoeven, Ann. Ma...
详细信息
In their recent paper, Ramezani et al. [Phys. Rev. A 108, 052405 (2023)] presented a quantum multiplication algorithm with O(Nlog2(N)) operations, while the best classical algorithm [Harvey and van der Hoeven, Ann. Math. 193, 563 (2021)] needs O(Nlog(N)) operations. This Comment corrects the incompleteness of the quantum complexity, showing that the classical method performs better.
Photonics has been a promising platform for implementing quantum technologies owing to its scalability and robustness. In this paper, we demonstrate the encoding of information in 32 time bins or dimensions of a singl...
详细信息
Photonics has been a promising platform for implementing quantum technologies owing to its scalability and robustness. In this paper, we demonstrate the encoding of information in 32 time bins or dimensions of a single photon. A practical scheme for manipulating the single photon in high dimensions is experimentally realized to implement a compiled version of Shor’s algorithm on a single photon. Our work demonstrates the powerful information-processing capacity of a high-dimensional quantum system for complex quantuminformation tasks.
The entropy wall concept plays a vital role in ensuring the high degree of randomness and unpredictability necessary for robust cryptographic systems. Natural sources of entropy, such as the dynamic and non-reproducib...
详细信息
ISBN:
(数字)9783031752339
ISBN:
(纸本)9783031752322;9783031752339
The entropy wall concept plays a vital role in ensuring the high degree of randomness and unpredictability necessary for robust cryptographic systems. Natural sources of entropy, such as the dynamic and non-reproducible properties of physical phenomena, provide a superior foundation for generating cryptographic keys. By leveraging such sources, one can effectively defend against potential vulnerabilities and emerging threats, including those posed by artificial intelligence and quantum computing. This paper introduces a method for generating encryption keys for AES 128 bits algorithm by utilizing entropy barriers from real-world sources, specifically video frames of juice being continuously shaken. By exploiting the inherent randomness of these video frames, the proposed approach aims to enhance cryptographic security by producing keys that provide an additional layer of protection to conventional encryption algorithms. The analysis includes an evaluation with the performance based on different key sizes and entropy evaluation.
This article analyzes aspects of the problem of remote state estimation (RSE) via noisy communication channels for their Blum-Shub-Smale (BSS) computability, motivated by an exemplary application to a formal model of ...
详细信息
This article analyzes aspects of the problem of remote state estimation (RSE) via noisy communication channels for their Blum-Shub-Smale (BSS) computability, motivated by an exemplary application to a formal model of virtual twinning subject to stringent integrity requirements. Computability theory provides a unique framework for the formal and mathematically rigorous analysis of algorithms and computing machines. Therefore, computability theory is essential in the domain of safety- and life-critical technology, where the formal verification of automated systems is necessary. Based on the RSE problem, we establish a simple mathematical model of virtual-twin systems that entails a formal notion of integrity (i.e., a state where the virtual entity accurately mirrors its physical counterpart). The model's notion of integrity is related to the question of whether the system under consideration is capable of computing the communication channel's zero-error capacity and corresponding zero-error codes. While this task is known to exceed the theoretical capabilities of Turing computers, we prove its formal feasibility within the model BSS machines. As different authors have proposed BSS machines as potential model of some forms of analog computing, this article serves as a proof-of-concept for a theoretical analog supremacy of unconventional information-processing hardware. Considering recent advances in the development of such hardware, forms of analog supremacy will likely become relevant in the future of cyber-physical systems and information technology.
This paper presents a hybrid variational quantum algorithm that finds a random eigenvector of a unitary matrix with a known quantum circuit. The algorithm is based on the SWAP test on trial states generated by a param...
详细信息
This paper presents a hybrid variational quantum algorithm that finds a random eigenvector of a unitary matrix with a known quantum circuit. The algorithm is based on the SWAP test on trial states generated by a parametrized quantum circuit. The eigenvector is described by a compact set of classical parameters that can be used to reproduce the found approximation to the eigenstate on demand. This variational eigenvector finder can be adapted to solve the generalized eigenvalue problem, to find the eigenvectors of normal matrices and to perform quantum principal component analysis on unknown input mixed states. These algorithms can all be run with low-depth quantum circuits, suitable for an efficient implementation on noisy intermediate-scale quantum computers and, with some restrictions, on linear optical systems. In full-scale quantum computers, where there might be optimization problems due to barren plateaus in larger systems, the proposed algorithms can be used as a primitive to boost known quantumalgorithms. Limitations and potential applications are discussed.
暂无评论