The literature indicates that the qubit requirements for factoring RSA-2048 remain on the order of 1 million, under commonly assumed architectures and error-correction models, leaving a substantial gap between current resource estimates and near-term...
To ensure confidentiality and integrity in the era of quantum computing, most post-quantum cryptographic schemes are designed to achieve either encryption or digital signature functionalities separately. Although a few signcryption schemes exist that...
We theoretically investigate the evolution of the peak height of energy-resolved electronic wave-packets ballistically propagating along integer quantum Hall edge channels at filling factor equal to two. This is ultimately related to the elastic scat...
The integer quantum Hall effect (IQHE), Z2 topological insulators (TIs), and quantum capacitance are generally treated as separate subjects, yet they share a common thread: bulk topology gives rise to a protected boundary state, and quantum capacitan...
We discuss quantum Hall effect in the presence of arbitrary pair interactions between electrons. It is shown that, irrespective of the interaction strength, the Hall conductivity is given by the filling fraction of Landau levels averaged over the gro...
The quantum Hall effect under the influence of gravity and inertia is studied in a unified way. We make use of an algebraic approach, as opposed to an analytic approach. We examine how both the integer and the fractional quantum Hall effects behave u...
The factorial-additive optimality of primes, i.e., that the sum of prime factors is always minimum, implies that prime numbers are a solution to an integer linear programming (ILP) encoding optimization problem. The summative optimality of primes fol...
In this paper, we present a new class of Leonardo hybrid numbers that incorporate quantum integers into their components. This advancement presents a broader generalization of the q-Leonardo hybrid numbers. We explore some fundamental properties asso...
Certificateless signatures (CLS) are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previou...
We describe two mixed-integer linear programming formulations, one a faster version of a previous proposal, the other a slower but better performing new model, for the design of Quantum Key Distribution (QKD) sub-networks dimensioned to secure existi...
Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters o...
This paper addresses the Pickup and Delivery Problem with Time Windows (PDPTW), an NP-hard combinatorial optimization problem with major practical relevance in logistics and transportation. The study focuses on a quadratic unconstrained binary optimi...
Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. However, the solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing effects arise wh...
The superposition principle in quantum mechanics enables the encoding of an entire solution space within a single quantum state. By employing quantum routines such as amplitude amplification or the Quantum Approximate Optimization Algorithm (QAOA), t...
In classical computation, Toom–Cook is one of the multiplication methods for large numbers which offers faster execution time compared to other algorithms such as schoolbook and Karatsuba multiplication. For the use in quantum computation, prior work...
Digital signature with proxy delegation, which is a secure ownership enforcement tool, allows an original signer to delegate signature rights to a third party called proxy, so that the proxy can sign messages on behalf of the original signer. Many re...
We discuss the tight-binding models of solid state physics with the
We present a protocol for integer factorization for all integers N below a certain cut-off
As a discrete-time quantum walk model on the one-dimensional integer lattice
In this paper, we proposed the exactly solvable model of non-Markovian dynamics of open quantum systems. This model describes open quantum systems with memory and periodic sequence of kicks by environment. To describe these systems, the Lindblad equa...
The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems’ security in use today. Although there is a quantum-based technique with a polynomial time for integer factoring, on a tradi...
In this paper, by using q-integers and higher-order generalized Fibonacci numbers, we define the higher-order generalized Fibonacci quaternions with q-integer components. We give some special cases of these newly established quaternions. This article...
The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional integer la...
Since the discovery of the quantum Hall effect in 1980, it has attracted intense interest in condensed matter physics and has led to a new type of metrological standard by utilizing the resistance quantum. Graphene, a true two-dimensional electron ga...
Die-rolling is the cryptographic task where two mistrustful, remote parties wish to generate a random D-sided die-roll over a communication channel. Optimal quantum protocols for this task have been given by Aharon and Silman (New Journal of Physics,...
Due to the computational limitations at present, there is no efficient integer factorization algorithm that can break at least 2048 bits of RSA with strong prime factors in polynomial time. Although Shor’s algorithm based on a quantum computer...
Multiplications in
With the rapid development of quantum theory, the discrete logarithm problem and significant integer factorization problem have polynomial solution algorithms under quantum computing, and their security is seriously threatened. Therefore, a three-par...
Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the advantage of q...
Quantum arithmetic logic units (QALUs) perform essential arithmetic operations within a quantum framework, serving as the building blocks for more complex computations and algorithms in quantum computing. In this paper, we present an approach to prep...
Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems. Quantum computing threatens RSA and ECC wit...
Carbon-neutral industrial parks require large consumers, such as data centers, to balance low-carbon operation and service reliability. This paper proposes a resilience-constrained stochastic dispatch framework for a data-center virtual power plant (...
In the practical context of quantum networks, the most reliable method of transmitting quantum information is via teleportation because quantum states are highly sensitive. However, teleportation consumes a shared maximally entangled state. Two parti...
Quantum error correcting codes (QECCs) play an important role in preventing quantum information decoherence. Good quantum stabilizer codes were constructed by classical error correcting codes. In this paper, Bose–Chaudhuri–Hocquenghem (BCH) codes ove...
We investigate Floquet dynamics of a particle held in a three-well system driven by a two-frequency field and identify integer and fractional photon resonances due to the dual-frequency driving. It is found that pairs of photon-assisted tunneling nea...
Many properties of special numbers, such as sum formulas, symmetric properties, and their relationships with each other, have been studied in the literature with the help of the Binet formula and generating function. In this paper, higher-order gener...
In this paper, we propose DiLizium: a new lattice-based two-party signature scheme. Our scheme is constructed from a variant of the Crystals-Dilithium post-quantum signature scheme. This allows for more efficient two-party implementation compared wit...
We consider a quantum and a classical version of a multi-party function computation problem with n players, where players
Due to the rapid development of machine-learning technology, companies can build complex models to provide prediction or classification services for customers without resources. A large number of related solutions exist to protect the privacy of mode...
We perform an experimental test where we directly observe light-induced electron transitions with a macroscopic spatial discontinuity. The effect is related to the fundamental indivisibility of macroscopic orbit-like quantum states reminiscent of so-...
Private array equality comparison (PAEC) aims to evaluate whether two arrays are equal while maintaining the confidentiality of their elements. Current private comparison protocols predominantly focus on determining the relationships of secret intege...
Current private comparison schemes primarily focus on comparing single secret integers using quantum technologies, while the area of private array content comparison remains relatively unexplored. To bridge this gap, we introduce a quantum private ar...
Quantum computing is a new discipline that uses the ideas of quantum physics to do calculations that are not possible with conventional computers. Quantum bits, called qubits, could exist in superposition states, making them suitable for parallel pro...
Integration in non-integer-dimensional spaces (NIDS) is actively used in quantum field theory, statistical physics, and fractal media physics. The integration over the entire momentum space with non-integer dimensions was first proposed by Wilson in...
Our study explores the feasibility of quantum computing in emission tomography reconstruction, addressing a noisy ill-conditioned inverse problem. In current clinical practice, this is typically solved by iterative methods minimizing a
We report the topological properties, in terms of the Berry phase, of the 2D noninteracting system with electron–hole band inversion, described by the two-band generalized analogue of the low-energy Bernevig–Hughes–Zhang Hamiltonian...
Singular systems, which can be applied to gauge field theory, condensed matter theory, quantum field theory of anyons, and so on, are important dynamic systems to study. The fractional order model can describe the mechanical and physical behavior of...
As quantum computing technology continues to develop, the need for research into novel quantum algorithms is growing. However, such algorithms cannot yet be reliably tested on actual quantum hardware, which is still limited in several ways, including...
We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and ca...
From an arbitrary definition of operators inspired by oscillators of Virasoro, an algebra is derived. It fits the structure of Virasoro algebra with null central charge or Witt algebra. The resulting formalism has yielded commutators with a dependenc...
of 4