Results 71 to 80 of about 7,819 (154)
Layered architecture for quantum computing
We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design.
Alexei Yu. Kitaev +23 more
core +2 more sources
Addressing ecological challenges from a quantum computing perspective
Abstract With increased access to data and the advent of computers, the use of statistical tools and numerical simulations is becoming commonplace for ecologists. These approaches help improve our understanding of ecological phenomena and their underlying mechanisms in increasingly complex environments.
Maxime Clenet +2 more
wiley +1 more source
Universality of Entanglement and Quantum Computation Complexity
We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover's problem. The analytic result for
José I. Latorre +9 more
core +1 more source
ABSTRACT This study focuses on the process by which doctoral researchers construct epistemic sovereignty and control in AI‐assisted writing. This study employs a duoethnographic approach to analyse the reflective dialogues of two multidisciplinary doctoral researchers.
Xiaofei Ma +3 more
wiley +1 more source
Integer Factorization – Cryptology Meets Number Theory
Integer factorization is one of the oldest mathematical problems. Initially, the interest in factorization was motivated by curiosity about behaviour of prime numbers, which are the basic building blocks of all other integers.
Josef Pieprzyk
doaj +1 more source
Surrogate Quantum Circuit Design for the Lattice Boltzmann Collision Operator
ABSTRACT This study introduces a framework for learning a low‐depth surrogate quantum circuit (SQC) that approximates the nonlinear, dissipative, and hence non‐unitary Bhatnagar–Gross–Krook (BGK) collision operator in the lattice Boltzmann method (LBM) for the D2Q9$$ {D}_2{Q}_9 $$ lattice.
Monica Lăcătuş, Matthias Möller
wiley +1 more source
Factorization of large tetra and penta prime numbers on IBM quantum processor
The factorization of large digit integers in polynomial time is a challenging computational task to decipher. The development of Shor’s algorithm sparked a new resolution for solving the factorization problem.
Ritu Dhaulakhandi +2 more
doaj +1 more source
New Quantum Cryptanalysis of Binary Elliptic Curves
This paper improves upon the quantum circuits required for the Shor’s attack on binary elliptic curves. We present two types of quantum point addition, taking both qubit count and circuit depth into consideration.
Kyungbae Jang +4 more
doaj +1 more source
Energy Consumption Framework and Analysis of Post-Quantum Key-Generation on Embedded Devices
The emergence of quantum computing and Shor’s algorithm necessitates an imminent shift from current public key cryptography techniques to post-quantum-robust techniques.
J. Cameron Patterson +2 more
doaj +1 more source
Quantum algorithm for solving binary hyperelliptic curve discrete logarithm problem
It is well-established that Shor’s algorithm can solve the discrete logarithm problem (DLP) in polynomial time. The hyperelliptic curve DLP (HCDLP) of genus 2 has found widespread industrial applications and remains an active research domain.
Yan Huang +4 more
doaj +1 more source

