Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
14
Quantum-Statistical Annealing Computation
, 2001
"... We develop a quantum computer architecture using quantum statistics and thermal annealing that is highly parallel and robust with respect to decoherence. The most general bounded computation can be expressed as solving a Boolean network. Quantum-statistical annealing (qusa) computation satisfies all ..."
Abstract
- Add to MetaCart
We develop a quantum computer architecture using quantum statistics and thermal annealing that is highly parallel and robust with respect to decoherence. The most general bounded computation can be expressed as solving a Boolean network. Quantum-statistical annealing (qusa) computation satisfies
Quantum statistical computation
, 2001
"... In quantum ground-mode computation, the logical relations among qubits that must be satisfied by the solution are realized in the ground mode of a quantum network representing the problem. In quantum statistical computation some of the logical relations are satisfied identically in virtue of quantum ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
of quantum statistics, which takes no time. For example triplet pairs of spin-1/2 fermions as in orthohydrogen make useful three-terminal elements for quantum computation. When interconnected by qubit equality relations these become universal for quantum computation. We show that quantum-statistical
1Quantum Annealing of Hard Problems
"... Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems for which the efficiency can be studied analytically using t ..."
Abstract
- Add to MetaCart
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems for which the efficiency can be studied analytically using
Quantum Annealing of a Disordered Spin System
, 2001
"... Traditional simulated annealing utilizes thermal fluctuations for convergence in optimization problems. Quantum tunneling provides a different mechanism for moving between states, with the potential for reduced time scales. We compare thermal and quantum annealing in a model disordered Ising magnet, ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Traditional simulated annealing utilizes thermal fluctuations for convergence in optimization problems. Quantum tunneling provides a different mechanism for moving between states, with the potential for reduced time scales. We compare thermal and quantum annealing in a model disordered Ising magnet
Performance of simulated annealing in p-spin glasses
"... Abstract. We perform careful numerical simulations of slow Monte-Carlo annealings in the dense 3-body spin glass model and compare with the predictions from different theories: thresholds states, isocomplexity, following state. We conclude that while isocomplexity and following state both provide ex ..."
Abstract
- Add to MetaCart
what statistical mechanics is about from the very beginning: we prefer to consider the static average over all configurations rather than the complex dynamics of all atoms. A particularly important case, both in classical and quantum thermodynamics, is given by the dynamics after very slow variations
Ab-Initio Calculation of Equilibrium Structures for Na Clusters using the Hybrid Simulated Annealing
"... We use the Hybrid Simulated Annealing[1] (HSA), a variant of the Simulated Annealing method for optimization of multivariate functions, for the search of the equilibrium structures for quantum systems, for instance Na small clusters, using ab-initio calculations based in the Car-Parrinello method. ..."
Abstract
- Add to MetaCart
We use the Hybrid Simulated Annealing[1] (HSA), a variant of the Simulated Annealing method for optimization of multivariate functions, for the search of the equilibrium structures for quantum systems, for instance Na small clusters, using ab-initio calculations based in the Car-Parrinello method
Population Monte Carlo algorithms
- In Transactions of the Japanese Society for Artificial Intelligence
, 2001
"... We give a cross-disciplinary survey on “population ” Monte Carlo algorithms. In these algorithms, a set of “walkers ” or “particles ” is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are deve ..."
Abstract
-
Cited by 18 (1 self)
- Add to MetaCart
are developed in various fields in physics and statistical sciences and called by lots of different terms – “quantum Monte Carlo”, “transfermatrix Monte Carlo”, “Monte Carlo filter (particle filter)”,“sequential Monte Carlo ” and “PERM ” etc. Here we discuss them in a coherent framework. We also touch
The F model on dynamical quadrangulations
, 2004
"... The dynamically triangulated random surface (DTRS) approach to Euclidean quantum gravity in two dimensions is considered for the case of the elemental building blocks being quadrangles instead of the usually used triangles. The well-known algorithmic tools for treating dynamical triangulations in a ..."
Abstract
- Add to MetaCart
The dynamically triangulated random surface (DTRS) approach to Euclidean quantum gravity in two dimensions is considered for the case of the elemental building blocks being quadrangles instead of the usually used triangles. The well-known algorithmic tools for treating dynamical triangulations in a
Reply to: Comment on “Quantum Optimization for Combinatorial Searches”
, 2002
"... This is my reply to Zalka and Brun’s criticism of my recent paper on quantum optimization heuristics. Essentially, this criticism is shown to be utterly irrelevant. In a recent publication [1] I proposed a quantum optimization heuristic for combinatorial search problems. The basic idea is to generat ..."
Abstract
- Add to MetaCart
is to generate a quantum superposition of search states such that the corresponding probability distribution for measurement outcomes is strongly peaked on low-cost states, in analogy to a thermal Boltzmann distribution, and to apply then standard thermodynamic reasoning, as in simulated annealing
Accelerated Dynamics In Simulations Of First Order Phase Transitions
"... . We show that the method of Fourier acceleration can be used to speed up tunnelling between degenerate and near-degenerate minima of the effective action in Langevin simulations of statistical systems. Acceleration factors of two orders of magnitude are attained. Such improvement is important for t ..."
Abstract
- Add to MetaCart
. We show that the method of Fourier acceleration can be used to speed up tunnelling between degenerate and near-degenerate minima of the effective action in Langevin simulations of statistical systems. Acceleration factors of two orders of magnitude are attained. Such improvement is important
Results 1 - 10
of
14
