Experimental determination of Ramsey numbers.

@article{Bian2013ExperimentalDO,
  title={Experimental determination of Ramsey numbers.},
  author={Zhengbing Bian and Fabi{\'a}n A. Chudak and William G. Macready and Lane H. Clark and Frank Gaitan},
  journal={Physical review letters},
  year={2013},
  volume={111 13},
  pages={
          130505
        }
}
Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures. Ramsey numbers mark the threshold at which order first appears and are extremely difficult to calculate due to their explosive rate of growth. Recently, an algorithm that can be implemented using adiabatic quantum evolution has been proposed that calculates the two-color Ramsey numbers R(m,n). Here we present results of an experimental implementation of this… 

Generalized Ramsey numbers through adiabatic quantum optimization

A quantum algorithm for computing generalized Ramsey numbers is presented by reformulating the computation as a combinatorial optimization problem which is solved using adiabatic quantum optimization and the Ramsey numbers r(Tm,Tn) are determined.

Subject Areas : Quantum Information A Viewpoint on : Experimental Determination of Ramsey Numbers

What is a quantum computer? We could say it’s a machine that calculates solutions to problems using quantum components. But this definition is incomplete; after all, an abacus is made of quantum

Practical designs for permutation-symmetric problem Hamiltonians on hypercubes

A method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation is presented, providing a powerful tool for benchmarking quantum hardware and experimentally investigating the physics of continuous- time quantum protocols.

Ultrafast Ramsey interferometry to implement cold atomic qubit gates

An experimental demonstration of arbitrary single-qubit SU(2) quantum gate operations achieved at a terahertz clock speed and Bloch vector manipulation about all three rotational axes was demonstrated.

Quantum Optimization of Fully-Connected Spin Glasses

The Sherrington-Kirkpatrick model with random $\pm1$ couplings is programmed on the D-Wave Two annealer featuring 509 qubits interacting on a Chimera-type graph. The performance of the optimizer

Electronic Structure Calculations and the Ising Hamiltonian.

It is shown that one can map the molecular Hamiltonian to an Ising-type Hamiltonian which could easily be implemented on currently available quantum hardware and is an early step in developing generalized methods on such devices for chemical physics.

How fast can quantum annealers count?

We outline an algorithm for the quantum counting problem using adiabatic quantum computation (AQC). We show that the mechanism of quantum-adiabatic evolution may be utilized toward estimating the

Mathematical Modeling and Simulation of 3-Qubits Quantum Annealing Processor

In this paper, a new model of 3-qubits quantum annealing processor is designed. The spin-chain model is used to simulate the quantum annealing processor. The Hamiltonian which describes the system is

Quantum Annealing and Computation: A Brief Documentary Note

Major breakthrough in quantum computation has recently been achieved using quantum annealing to develop analog quantum computers instead of gate based computers. After a short introduction to quantum

Quantum Annealing for Constrained Optimization

This work proposes a method for encoding constrained optimization problems on quantum annealers that reduces the number of required couplers and removes the need for minor embedding, greatly reducing thenumber of required physical qubits.
...

References

SHOWING 1-10 OF 18 REFERENCES

Ramsey numbers and adiabatic quantum computing.

It is shown how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution, and that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.

Quantum Computation by Adiabatic Evolution

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that

Decoherence induced deformation of the ground state in adiabatic quantum computation

Despite more than a decade of research on adiabatic quantum computation (AQC), its decoherence properties are still poorly understood. Many theoretical works have suggested that AQC is more robust

Ten lectures on the probabilistic method

This is an examination of what is known about the probabilistic method. Based on the notes from the author's 1986 series of ten lectures, this edition features an additional lecture: The Janson

Phys

  • Rev. Lett. 108, 010501
  • 2012

Ramsey Theory

I and J

Phys. Rev. Lett

  • Phys. Rev. Lett
  • 2012

Phys

  • Rev. Lett. 108, 130501
  • 2012