Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Quantum annealing for the number-partitioning problem using a tunable spin glass of ions.

ABSTRACT: Exploiting quantum properties to outperform classical ways of information processing is an outstanding goal of modern physics. A promising route is quantum simulation, which aims at implementing relevant and computationally hard problems in controllable quantum systems. Here we demonstrate that in a trapped ion setup, with present day technology, it is possible to realize a spin model of the Mattis-type that exhibits spin glass phases. Our method produces the glassy behaviour without the need for any disorder potential, just by controlling the detuning of the spin-phonon coupling. Applying a transverse field, the system can be used to benchmark quantum annealing strategies which aim at reaching the ground state of the spin glass starting from the paramagnetic phase. In the vicinity of a phonon resonance, the problem maps onto number partitioning, and instances which are difficult to address classically can be implemented.

SUBMITTER: Graß T

PROVIDER: S-EPMC4894973 | biostudies-other | 2016

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Zero-temperature quantum annealing bottlenecks in the spin-glass phase.

Project description:A promising approach to solving hard binary optimization problems is quantum adiabatic annealing in a transverse magnetic field. An instantaneous ground state-initially a symmetric superposition of all possible assignments of N qubits-is closely tracked as it becomes more and more localized near the global minimum of the classical energy. Regions where the energy gap to excited states is small (for instance at the phase transition) are the algorithm's bottlenecks. Here I show how for large problems the complexity becomes dominated by O(log N) bottlenecks inside the spin-glass phase, where the gap scales as a stretched exponential. For smaller N, only the gap at the critical point is relevant, where it scales polynomially, as long as the phase transition is second order. This phenomenon is demonstrated rigorously for the two-pattern Gaussian Hopfield model. Qualitative comparison with the Sherrington-Kirkpatrick model leads to similar conclusions.

| S-EPMC4980455 | biostudies-literature

Solving Set Cover with Pairs Problem using Quantum Annealing.

Project description:Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schrödinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction on the D-wave type restricted Ising Hamiltonian based on Chimera graphs. Our embedding on the Chimera graph preserves the structure of the original SCP instance and in particular, the embedding for general complete bipartite graphs and logical disjunctions may be of broader use than that the specific problem we deal with.

| S-EPMC5037405 | biostudies-literature

Optical computation of a spin glass dynamics with tunable complexity.

Project description:Spin glasses (SGs) are paradigmatic models for physical, computer science, biological, and social systems. The problem of studying the dynamics for SG models is nondetermistic polynomial-time (NP) hard; that is, no algorithm solves it in polynomial time. Here we implement the optical simulation of an SG, exploiting the N segments of a wavefront-shaping device to play the role of the spin variables, combining the interference downstream of a scattering material to implement the random couplings between the spins (the [Formula: see text] matrix) and measuring the light intensity on a number P of targets to retrieve the energy of the system. By implementing a plain Metropolis algorithm, we are able to simulate the spin model dynamics, while the degree of complexity of the potential energy landscape and the region of phase diagram explored are user defined, acting on the ratio [Formula: see text] We study experimentally, numerically, and analytically this Hopfield-like system displaying a paramagnetic, ferromagnetic, and SG phase, and we demonstrate that the transition temperature [Formula: see text] to the glassy phase from the paramagnetic phase grows with α. We demonstrate the computational advantage of the optical SG where interaction terms are realized simultaneously when the independent light rays interfere on the detector's surface. This inherently parallel measurement of the energy provides a speedup with respect to purely in silico simulations scaling with N.

| S-EPMC8166028 | biostudies-literature

Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian.

Project description:Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial state to a low energy state of a target Ising Hamiltonian of quantum spins, HI. Here, we point to the existence of an analytical solution for such a problem for an arbitrary HI beyond the adiabatic limit for QA. This solution provides insights into the accuracy of nonadiabatic computations. Our QA protocol in the pseudo-adiabatic regime leads to a monotonic power-law suppression of nonadiabatic excitations with time T of QA, without any signature of a transition to a glass phase, which is usually characterized by a logarithmic energy relaxation. This behavior suggests that the energy relaxation can differ in classical and quantum spin glasses strongly, when it is assisted by external time-dependent fields. In specific cases of HI, the solution also shows a considerable quantum speedup in computations.

| S-EPMC9038765 | biostudies-literature

Quantum annealing versus classical machine learning applied to a simplified computational biology problem.

Project description:Transcription factors regulate gene expression, but how these proteins recognize and specifically bind to their DNA targets is still debated. Machine learning models are effective means to reveal interaction mechanisms. Here we studied the ability of a quantum machine learning approach to predict binding specificity. Using simplified datasets of a small number of DNA sequences derived from actual binding affinity experiments, we trained a commercially available quantum annealer to classify and rank transcription factor binding. The results were compared to state-of-the-art classical approaches for the same simplified datasets, including simulated annealing, simulated quantum annealing, multiple linear regression, LASSO, and extreme gradient boosting. Despite technological limitations, we find a slight advantage in classification performance and nearly equal ranking performance using the quantum annealer for these fairly small training data sets. Thus, we propose that quantum annealing might be an effective method to implement machine learning for certain computational biology problems.

| S-EPMC5891835 | biostudies-literature

Experimental quantum annealing: case study involving the graph isomorphism problem.

Project description:Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N(2) to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers.

| S-EPMC4459189 | biostudies-other

Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability.

Project description:Closed-system quantum annealing is expected to sometimes fail spectacularly in solving simple problems for which the gap becomes exponentially small in the problem size. Much less is known about whether this gap scaling also impedes open-system quantum annealing. Here, we study the performance of a quantum annealing processor in solving such a problem: a ferromagnetic chain with sectors of alternating coupling strength that is classically trivial but exhibits an exponentially decreasing gap in the sector size. The gap is several orders of magnitude smaller than the device temperature. Contrary to the closed-system expectation, the success probability rises for sufficiently large sector sizes. The success probability is strongly correlated with the number of thermally accessible excited states at the critical point. We demonstrate that this behavior is consistent with a quantum open-system description that is unrelated to thermal relaxation, and is instead dominated by the system's properties at the critical point.

| S-EPMC6060131 | biostudies-literature

Prime factorization using quantum annealing and computational algebraic geometry.

Project description:We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians.

| S-EPMC5318873 | biostudies-literature

Tunable spin and valley dependent magneto-optical absorption in molybdenum disulfide quantum dots.

Project description:Photonic quantum computer, quantum communication, quantum metrology and quantum optical technologies rely on the single-photon source (SPS). However, the SPS with valley-polarization remains elusive and the tunability of magneto-optical transition frequency and emission/absorption intensity is restricted, in spite of being highly in demand for valleytronic applications. Here we report a new class of SPSs based on carriers spatially localized in two-dimensional monolayer transition metal dichalcogenide quantum dots (QDs). We demonstrate that the photons are absorbed (or emitted) in the QDs with distinct energy but definite valley-polarization. The spin-coupled valley-polarization is invariant under either spatial or magnetic quantum quantization. However, the magneto-optical absorption peaks undergo a blue shift as the quantization is enhanced. Moreover, the absorption spectrum pattern changes considerably with a variation of Fermi energy. This together with the controllability of absorption spectrum by spatial and magnetic quantizations, offers the possibility of tuning the magneto-optical properties at will, subject to the robust spin-coupled valley polarization.

| S-EPMC5253649 | biostudies-literature

A novel approach for solving travelling thief problem using enhanced simulated annealing.

Project description:Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques. The Traveling Thief Problem (TTP) is an optimization problem that combines two well-known NP-Hard problems including the 0/1 knapsack problem and traveling salesman problem. TTP contains a person known as a thief who plans a tour to collect multiple items to fill his knapsack to gain maximum profit while incurring minimum cost in a standard time interval of 600 s. This paper proposed an efficient technique to solve the TTP problem by rearranging the steps of the knapsack. Initially, the picking strategy starts randomly and then a traversal plan is generated through the Lin-Kernighan heuristic. This traversal is then improved by eliminating the insignificant cities which contribute towards profit adversely by applying the modified simulated annealing technique. The proposed technique on different instances shows promising results as compared to other state-of-the-art algorithms. This technique has outperformed on a small and medium-size instance and competitive results have been obtained in the context of relatively larger instances.

| S-EPMC8022508 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data