Related papers: Folding lattice proteins confined on minimal grids…
Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.
The recent advent of commercially available quantum annealing hardware (QAH) has expanded opportunities for research into quantum annealing-based algorithms. In the domain of power systems, this advancement has driven increased interest in…
We consider two- and three-dimensional lattice models of proteins which were characterized previously. We coarse grain their folding dynamics by reducing it to transitions between effective states. We consider two methods of selection of…
We propose and analyze a set of variational quantum algorithms for solving quadratic unconstrained binary optimization problems where a problem consisting of $n_c$ classical variables can be implemented on $\mathcal O(\log n_c)$ number of…
Commercial quantum annealers from D-Wave Systems can find high quality solutions of quadratic unconstrained binary optimization problems that can be embedded onto its hardware. However, even though such devices currently offer up to 2048…
Solving the electronic Schrodinger equation for strongly correlated ground states is a long-standing challenge. We present quantum algorithms for the variational optimization of wavefunctions correlated by products of unitary operators,…
Quantum optimal control problems are typically solved by gradient-based algorithms such as GRAPE, which suffer from exponential growth in storage with increasing number of qubits and linear growth in memory requirements with increasing…
Quantum computations are very important branch of modern cryptology. According to the number of working physical qubits available in general-purpose quantum computers and in quantum annealers, there is no coincidence, that nowadays quantum…
Modular architectures are a promising approach to scaling quantum computers to fault tolerance. Small, low-noise quantum processors connected through relatively noisy quantum links are capable of fault-tolerant operation as long as the…
We propose an algorithm inspired by optical coherent Ising machines to solve the problem of polynomial unconstrained binary optimization (PUBO). We benchmark the proposed algorithm against existing PUBO algorithms on the extended…
Power grid partitioning is an important requirement for resilient distribution grids. Since electricity production is progressively shifted to the distribution side, dynamic identification of self-reliant grid subsets becomes crucial for…
The ultimate goal of any sparse coding method is to accurately recover from a few noisy linear measurements, an unknown sparse vector. Unfortunately, this estimation problem is NP-hard in general, and it is therefore always approached with…
The advent of quantum computing necessitates the transition of worldwide cryptosystems to post-quantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed…
We propose a new way of looking at global optimization of off-lattice protein models. We present a dual optimization concept of predicting optimal sequences as well as optimal folds. We validate the utility of the recently introduced…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
Optimization of electricity surplus is a crucial element for transmission power networks to reduce costs and efficiently use the available electricity across the network. In this paper we showed how to optimize such a network with quantum…
We present and discuss a novel approach to the direct and inverse protein folding problem. The proposed strategy is based on a variational approach that allows the simultaneous extraction of amino acid interactions and the low-temperature…
The qubits in a D-wave quantum annealer (D-wave QA) are designed on a Pegasus graph that is different from structure of a combinatorial optimization problem. This situation requires embedding with the chains connected by ferromagnetic (FM)…
We study the thermodynamic behavior of a simple off-lattice model for protein folding. The model is two-dimensional and has two different ``amino acids''. Using numerical simulations of all chains containing eight or ten monomers, we…
Utilizing present and futuristic Quantum Computers to solve difficult problems in different domains has become one of the main endeavors at this moment. Of course, in arriving at the requisite solution both quantum and classical computers…