46 search results - page 4 / 10 » Quantum algorithms for solvable groups |
AB
2007
Springer
15 years 5 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
106
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
103
click to vote
ENGL
2008
15 years 1 months ago
2008
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
COCO
2008
Springer
15 years 3 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
123
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...