Sciweavers

2661 search results - page 34 / 533
» Quantum Complexity Classes
Sort
View
IPPS
2003
IEEE
15 years 6 months ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...
FCT
2007
Springer
15 years 4 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 2 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
ISCOPE
1998
Springer
15 years 4 months ago
Parallel Object Oriented Monte Carlo Simulations
Abstract. We discuss the parallelization and object-oriented implementation of Monte Carlo simulations for physical problems. We present a C++ Monte Carlo class library for the aut...
Matthias Troyer, Beat Ammon, Elmar Heeb
106
Voted
IACR
2011
133views more  IACR 2011»
14 years 9 days ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti