|
Volumn 65, Issue 4 A, 2002, Pages 423091-4230910
|
Simulating Hamiltonians in quantum networks: Efficient schemes and complexity bounds
a a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTER SIMULATION;
HAMILTONIANS;
MATHEMATICAL TRANSFORMATIONS;
MATRIX ALGEBRA;
PROBLEM SOLVING;
THEOREM PROVING;
QUANTUM NETWORKS;
QUANTUM THEORY;
|
EID: 0036542094
PISSN: 10502947
EISSN: None
Source Type: Journal
DOI: None Document Type: Article |
Times cited : (47)
|
References (29)
|