Quantum-resistance in blockchain networks.

The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time.

Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances.

We present a new quantum heuristic algorithm aimed at finding satisfying assignments for hard K-SAT instances using a continuous time quantum walk that explicitly exploits the properties of quantum tunneling. Our algorithm uses a Hamiltonian [Formula: see text] which is specifically constructed to solve a K-SAT instance F. The heuristic algorithm aims at iteratively reducing the Hamming distance between an evolving state [Formula: see text] and a state that represents a satisfying assignment for F.

Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks.

Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunnelling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behaviour and efficiency at finding novel phenotypes between CRW and QW.

A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers.

Quantum annealing algorithms were introduced to solve combinatorial optimization problems by taking advantage of quantum fluctuations to escape local minima in complex energy landscapes typical of NP - hard problems. In this work, we propose using quantum annealing for the theory of cuts, a field of paramount importance in theoretical computer science. We have proposed a method to formulate the Minimum Multicut Problem into the QUBO representation, and the technical difficulties faced when embedding and submitting a problem to the quantum annealer processor.

A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers.

In this paper, we propose a methodology to solve the stereo matching problem through quantum annealing optimization. Our proposal takes advantage of the existing Min-Cut/Max-Flow network formulation of computer vision problems. Based on this network formulation, we construct a quadratic pseudo-Boolean function and then optimize it through the use of the D-Wave quantum annealing technology.