Sciweavers

2479 search results - page 62 / 496
» Quantum complexity theory
Sort
View
SIAMSC
2010
117views more  SIAMSC 2010»
13 years 8 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...
CDES
2008
87views Hardware» more  CDES 2008»
13 years 11 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
FOCS
2000
IEEE
14 years 2 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
EMSOFT
2011
Springer
12 years 10 months ago
RT-Xen: towards real-time hypervisor scheduling in xen
As system integration becomes an increasingly important challenge for complex real-time systems, there has been a significant demand for supporting real-time systems in virtualiz...
Sisu Xi, Justin Wilson, Chenyang Lu, Christopher D...
ISNN
2009
Springer
14 years 4 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu