Quantum-based wireless sensor networks: A review and open questions by Mario E Rivero-Angeles

“…Applications of quantum computing are growing at a very fast pace, for example, from quantum computers to quantum algorithms and even to the development of the quantum Internet. …”
Get full text

Dissipative Landau-Zener tunneling in the crossover regime from weak to strong environment coupling by X. Dai, R. Trappen, H. Chen, D. Melanson, M. A. Yurtalan, D. M. Tennant, A. J. Martinez, Y. Tang, E. Mozgunov, J. Gibson, J. A. Grover, S. M. Disseler, J. I. Basham, S. Novikov, R. Das, A. J. Melville, B. M. Niedzielski, C. F. Hirjibehedin, K. Serniak, S. J. Weber, J. L. Yoder, W. D. Oliver, K. M. Zick, D. A. Lidar, A. Lupascu

Get full text

5-pass zero-knowledge identity authentication scheme based on matrix completion problem by Houzhen WANG, Xinwei CAI, Yan GUO, Huanguo ZHANG

“…To solve the problem that most identity authentication schemes are vulnerable to quantum-computing attacks and low efficiency, a new 5-pass zero-knowledge identity authentication scheme was designed based on the matrix completion problem (MCP).Since the MCP is NP-complete, the proposed scheme has the potential to avoid quantum-computing attacks.Compared with the existing similar protocols, the proposed scheme reduced the fraud probability from 2/3 to 1/2 by adding a single round of interaction, and had the advantages of easy implementation and small key size.Moreover, based on the proposed zero-knowledge authentication scheme and Fiat-Shamir standard transformation method, a secure and efficient digital signature algorithm against quantum-computing can be obtained.…”
Get full text

Noise Robustness of Quantum Relaxation for Combinatorial Optimization by Kentaro Tamura, Yohichi Suzuki, Rudy Raymond, C. Hiroshi Watanabe, Yuki Sato, Ruho Kondo, Michihiko Sugawara, Naoki Yamamoto

Get full text

Neutron Interferometry at the National Institute of Standards and Technology by D. A. Pushin, M. G. Huber, M. Arif, C. B. Shahi, J. Nsofini, C. J. Wood, D. Sarenac, D. G. Cory

“…This new facility is based on QEC neutron interferometer, thus improving the accessibility of neutron interferometry to the greater scientific community and expanding its applications to quantum computing, gravity, and material research.…”
Get full text

Small-angle scattering interferometry with neutron orbital angular momentum states by Dusan Sarenac, Melissa E. Henderson, Huseyin Ekinci, Charles W. Clark, David G. Cory, Lisa DeBeer-Schmitt, Michael G. Huber, Owen Lailey, Jonathan S. White, Kirill Zhernenkov, Dmitry A. Pushin

Get full text

Testing and Debugging Quantum Circuits by Sara Ayman Metwalli, Rodney Van Meter

“…This work is a crucial step toward realizing robust quantum computing systems and their applications in various domains.…”
Get full text

Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes With Overcomplete Check Matrices by Sisi Miao, Alexander Schnerring, Haizheng Li, Laurent Schmalen

“…Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. …”
Get full text

Measuring Chern–Simons level k by braiding $$SU(2)_k$$ S U ( 2 ) k anyons by Artem Belov, Andrey Morozov

“…Abstract Chern–Simons theory in application to the quantum computing is actively developing at the present. …”
Get full text

Survey of code-based digital signatures by Yongcheng SONG, Xinyi HUANG, Wei WU, Haixia CHEN

“…The rapid development of quantum computing theory and practice brings great uncertainty to the security of cryptography based on hard problems in number theory.Code-based hard problem is recognized as NP-complete problem, the complexity increases exponentially, and there is currently no threat of quantum computing to code-based cryptographic algorithm.Therefore, code-based algorithm can resist the quantum algorithm attack, which is one of the main directions of quantum-resistant cryptography.It is still an open problem to design secure and efficient code-based signatures.For many years, international researchers use classical and new methods to construct code-based signatures, but existing constructions are weak in security or poor in performance.Code-based signatures were comprehensively summarized and analyzed, and future research directions were indicated.…”
Get full text

Proxy re-signature scheme based on isomorphisms of polynomial by Hui-xian LI, Lu SHAO, Liao-jun PANG

“…Most of the existing proxy resignature schemes were based on the hardness of big integer factoring,discrete logarithm,elliptic curve.However,none of them can resist the attack by a quantum computer.Motivated by these concerns,a new proxy resignature scheme was proposed.By employing secret affine transformations and homogeneous polynomials,the proposed scheme could implement the signature transformation with high-efficiency,and meanwhile it was secure against the attack by a quantum computer.The results of analysis showed that the proposed scheme was correct and consistent,and had the unforgeability in the random oracle model.Compared with the existing schemes,the proposed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems,but also has the properties of multi-use,transparent and private proxy.…”
Get full text

Optimizing the Electrical Interface for Large-Scale Color-Center Quantum Processors by Luc Enthoven, Masoud Babaie, Fabio Sebastiano

“…Quantum processors based on color centers in diamond are promising candidates for future large-scale quantum computers thanks to their flexible optical interface, (relatively) high operating temperature, and high-fidelity operation. …”
Get full text

Low-density parity-check representation of fault-tolerant quantum circuits by Ying Li

“…In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. …”
Get full text

Lattice-based lightweight post quantum access authentication scheme for satellite network by WANG Shanshan, ZHAO Guofeng, XU Chuan, HAN Zhenzhen

“…Aiming at the problems of quantum computing attacks, high authentication overhead and long interaction time in satellite network access authentication schemes, a lightweight post quantum access authentication scheme based on lattice for a satellite network was proposed. …”
Get full text

Geometric properties of quantum entanglement and machine learning by S. V. Zuev

“…The data was then displayed in a quantum state. A proprietary quantum computing emulator is used (it is in the public domain).Results. …”
Get full text

Post-quantum encryption technology based on BRLWE for internet of things by Yitian GAO, Liquan CHEN, Tianyang TU, Yuan GAO, Qianye CHEN

“…With the development of quantum computers, the classical public key encryption system is not capable enough to guarantee the communication security of internet of things (IoT).Because the mathematical puzzles which post-quantum encryption algorithms are based on cannot yet be broken by quantum computers, these new algorithms have good anti-quantum computing security.In particular, the lattice-based cryptography is expected to become the main technology of the next generation public key cryptosystem.However, post-quantum encryption algorithms have the disadvantages of large amount of computation and high storage space.The communication efficiency of IoT will be affected if post-quantum encryption algorithms are directly applied to the lightweight device under IoT environment.In order to better guarantee the communication security and improve the commutation efficiency of IoT, Sym-BRLWE (symmetrical binary RLWE) encryption scheme was proposed.Sym-BRLWE was improved from the existing post-quantum encryption scheme based on BRLWE (binary ringlearning with errors) problem.Specifically, Sym-BRLWE encryption algorithm met the efficiency requirements of IoT via improving the random number selection on the discrete uniform distribution and the calculation of the polynomial multiplication.Sym-BRLWE encryption algorithm achieved high efficiency and high security via adding encryption security precautions, then it is more suitable for IoT lightweight devices.From the security analysis, the proposed Sym-BRLWE encryption scheme had high security.It could theoretically resist lattice attacks, timing attacks, simple power analysis (SPA) and differential power analysis (DPA).From simulation experiments, which were carried out in a binary computing environment simulating an 8-bit micro-device, the proposed Sym-BRLWE encryption scheme has high efficiency and small key size in encryption and decryption.It could reduce the total encryption time by 30% to 40% when compared with other BRLWE-based encryption schemes with the parameter selection of the 140 bit quantum security level.…”
Get full text

Enhancing IoT security in smart grids with quantum-resistant hybrid encryption by Jian Xiong, Lu Shen, Yan Liu, Xiaofen Fang

“…The proposed QRHE-IoT mechanism presents a promising solution to these challenges, offering robust security for smart grid communications in the face of emerging threats, including quantum computing.…”
Get full text

Potential quantum advantage for simulation of fluid dynamics by Xiangyu Li, Xiaolong Yin, Nathan Wiebe, Jaehun Chun, Gregory K. Schenter, Margaret S. Cheung, Johannes Mülmenstädt

“…In this paper, we suggest that a quantum advantage may exist for simulating fluid dynamics, paving the way for simulating nonlinear multiscale transport phenomena in a wide range of disciplines using quantum computing.…”
Get full text

Comparative study of quantum error correction strategies for the heavy-hexagonal lattice by César Benito, Esperanza López, Borja Peropadre, Alejandro Bermudez

“…Topological quantum error correction is a milestone in the scaling roadmap of quantum computers, which targets circuits with trillions of gates that would allow running quantum algorithms for real-world problems. …”
Get full text

A Survey of Post-Quantum Cryptography Migration in Vehicles by Nils Lohmiller, Sabrina Kaniewski, Michael Menth, Tobias Heer

“…The advent of quantum computers makes asymmetric cryptographic algorithms insecure and vulnerable. …”
Get full text