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

Quantum complexity phase transitions in monitored random circuits by Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert, Philippe Faist

“…In our proof, we make use of percolation theory to find paths along which an exponentially long quantum computation can be run below the critical rate, and to identify events where the state complexity is reset to zero above the critical rate. …”
Get full text

Quantum dot nanomaterials: Empowering advances in optoelectronic devices by Mariam Akter Mimona, Md Israfil Hossain Rimon, Fatema Tuz Zohura, Jannatul Mawya Sony, Samira Islam Rim, Md Mostafizur Rahman Arup, Md Hosne Mobarak

Get full text

Symmetry-invariant quantum machine learning force fields by Isabel Nha Minh Le, Oriel Kiss, Julian Schuhmacher, Ivano Tavernelli, Francesco Tacchino

“…This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. …”
Get full text

Distributionally Robust Variational Quantum Algorithms With Shifted Noise by Zichang He, Bo Peng, Yuri Alexeev, Zheng Zhang

Get full text

Optical hausdorff quantum energy of spherical magnetic particles by Talat Körpinar, Zeliha Körpinar, Hatice özdemir, ALi Akgül, Murad Khan Hassani

Get full text

Parallelism of multi-scale quantum harmonic oscillator algorithm by Yan HUANG, Peng WANG, Kun CHENG, Feng LIU

“…MQHOA was a novel intelligent algorithm constructed by quantum harmonic oscillator's wave function.Sampling was the basic operation and main computational burden of MQHOA.The independence of sampling operation constructs MAHOA’s parallelism.Parallel granularity was obtained by experiments of group parameter and sampling parameter,and MQHOA-P was proposed.Experiments were done in a cluster of ten nodes on six standard test functions.By changing node number,function dimension and sampling parameter,experiments of MQHOA-P’s speed-up ratio were done.The experimental results show the good performance of MQHOA-P’s speed-up ratio and expansibility.MQHOA-P can be deployed and run on multiple nodes in a large-scale cluster.…”
Get full text

Efficient discrimination between real and complex quantum theories by Josep Batle, Tomasz Białecki, Tomasz Rybotycki, Jakub Tworzydło, Adam Bednorz

“…This large theoretical difference enables us to demonstrate the concomitant experimental violation on IBM quantum computer via a designed quantum network, without resorting to error mitigation, obtaining as a result $15.44$ at more than $100$ standard deviations above the found real bound.…”
Get full text

Multiplexed Quantum Communication with Surface and Hypergraph Product Codes by Shin Nishio, Nicholas Connolly, Nicolò Lo Piparo, William John Munro, Thomas Rowan Scruby, Kae Nemoto

“…Connecting multiple processors via quantum interconnect technologies could help overcome scalability issues in single-processor quantum computers. …”
Get full text

Construction of quantum BCH code based on cyclotomic coset by Lijuan XING, Zhuo LI

“…Quantum-error-correcting code can overcome quantum decoherence efficiently, which is the key technology to realize quantum computers.A series of quantum BCH code was proposed based on classical codes.First, a general way of well-chosen cyclotomic coset was introduced.A sufficient condition was given to calculate the number of elements in cyclotomic coset.Then, a series of quantum BCH (Bose-Chaudhuri-Hocquenghem) code over finite field F_q was constructed by CSS (Calderbank-Shor-Steane) construction and Steane construction.The results were extended to finite field F_q² with Hermitian construction.Compared with the results in literature,the range of introduced cyclotomic coset is more wide, and the new quantum BCH code has higher dimensions and better lower bounds on minimum distances.Furthermore, a family of quantum maximum distance separable (quantum MDS) code over any finite fields is constructed.…”
Get full text

Non-unitarity maximizing unraveling of open quantum dynamics by Ruben Daraban, Fabrizio Salas-Ramírez, Johannes Schachenmayer

“…Compared to other adaptive entanglement lowering algorithms, NUMU is computationally inexpensive. We demonstrate its utility in large-scale simulations with random quantum circuits. …”
Get full text

Quantum Entanglement: Separability, Measure, Fidelity of Teleportation, and Distillation by Ming Li, Shao-Ming Fei, Xianqing Li-Jost

Get full text

Approximate Solutions of Combinatorial Problems via Quantum Relaxations by Bryce Fuller, Charles Hadfield, Jennifer R. Glick, Takashi Imamichi, Toshinari Itoko, J. Richard Thompson, Yang Jiao, M. Marna Kagele, W. Blom-Schieber Adriana, Rudy Raymond, Antonio Mezzacapo

“…Understanding how to best use quantum computers for combinatorial optimization remains an ongoing area of study. …”
Get full text

Quantum quench dynamics of geometrically frustrated Ising models by Ammar Ali, Hanjing Xu, William Bernoudy, Alberto Nocera, Andrew D. King, Arnab Banerjee

Get full text

Using artificial intelligence methods for the optimal synthesis of reversible networks by Taras Kyryliuk, Mykhailo Palahuta, Vitaly Deibuk

Subjects: “…quantum computing…”
Get full text

Cryogenic Characterization of Low-Frequency Noise in 40-nm CMOS by Gerd Kiene, Sadik Ilik, Luigi Mastrodomenico, Masoud Babaie, Fabio Sebastiano

Subjects: Get full text

Directivity of Quantum Walk via Its Random Walk Replica by Tomoki Yamagami, Etsuo Segawa, Nicolas Chauvet, André Röhm, Ryoichi Horisaki, Makoto Naruse

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

Verifiable measurement-based quantum random sampling with trapped ions by Martin Ringbauer, Marcel Hinsche, Thomas Feldker, Paul K. Faehrmann, Juani Bermejo-Vega, Claire L. Edmunds, Lukas Postler, Roman Stricker, Christian D. Marciniak, Michael Meth, Ivan Pogorelov, Rainer Blatt, Philipp Schindler, Jens Eisert, Thomas Monz, Dominik Hangleiter

“…One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. …”
Get full text

Towards large-scale quantum optimization solvers with few qubits by Marco Sciorilli, Lucas Borges, Taylor L. Patti, Diego García-Martín, Giancarlo Camilo, Anima Anandkumar, Leandro Aolita

“…Abstract Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. …”
Get full text