Line data Source code
1 : // SPDX-FileCopyrightText: 2024 PairInteraction Developers
2 : // SPDX-License-Identifier: LGPL-3.0-or-later
3 :
4 : #include "pairinteraction/basis/Basis.hpp"
5 :
6 : #include "pairinteraction/basis/BasisAtom.hpp"
7 : #include "pairinteraction/basis/BasisPair.hpp"
8 : #include "pairinteraction/enums/Parity.hpp"
9 : #include "pairinteraction/enums/TransformationType.hpp"
10 : #include "pairinteraction/ket/KetAtom.hpp"
11 : #include "pairinteraction/ket/KetPair.hpp"
12 : #include "pairinteraction/utils/eigen_assertion.hpp"
13 : #include "pairinteraction/utils/eigen_compat.hpp"
14 : #include "pairinteraction/utils/wigner.hpp"
15 :
16 : #include <cassert>
17 : #include <numeric>
18 : #include <set>
19 :
20 : namespace pairinteraction {
21 :
22 : template <typename Scalar>
23 : class BasisAtom;
24 :
25 : template <typename Derived>
26 134 : void Basis<Derived>::perform_sorter_checks(const std::vector<TransformationType> &labels) const {
27 : // Check if the labels are valid sorting labels
28 244 : for (const auto &label : labels) {
29 110 : if (!utils::is_sorting(label)) {
30 0 : throw std::invalid_argument("One of the labels is not a valid sorting label.");
31 : }
32 : }
33 134 : }
34 :
35 : template <typename Derived>
36 59 : void Basis<Derived>::perform_blocks_checks(
37 : const std::set<TransformationType> &unique_labels) const {
38 : // Check if the states are sorted by the requested labels
39 59 : std::set<TransformationType> unique_labels_present;
40 93 : for (const auto &label : get_transformation().transformation_type) {
41 60 : if (!utils::is_sorting(label) || unique_labels_present.size() >= unique_labels.size()) {
42 26 : break;
43 : }
44 34 : unique_labels_present.insert(label);
45 : }
46 59 : if (unique_labels != unique_labels_present) {
47 0 : throw std::invalid_argument("The states are not sorted by the requested labels.");
48 : }
49 :
50 : // Throw a meaningful error if getting the blocks by energy is requested as this might be a
51 : // common mistake
52 59 : if (unique_labels.count(TransformationType::SORT_BY_ENERGY) > 0) {
53 0 : throw std::invalid_argument("States do not store the energy and thus no energy blocks can "
54 : "be obtained. Use an energy operator instead.");
55 : }
56 59 : }
57 :
58 : template <typename Derived>
59 41 : Basis<Derived>::Basis(ketvec_t &&kets)
60 82 : : kets(std::move(kets)), coefficients{{static_cast<Eigen::Index>(this->kets.size()),
61 41 : static_cast<Eigen::Index>(this->kets.size())},
62 82 : {TransformationType::SORT_BY_KET}} {
63 41 : if (this->kets.empty()) {
64 0 : throw std::invalid_argument("The basis must contain at least one element.");
65 : }
66 41 : state_index_to_quantum_number_f.reserve(this->kets.size());
67 41 : state_index_to_quantum_number_m.reserve(this->kets.size());
68 41 : state_index_to_parity.reserve(this->kets.size());
69 41 : ket_to_ket_index.reserve(this->kets.size());
70 41 : size_t index = 0;
71 9757 : for (const auto &ket : this->kets) {
72 9716 : state_index_to_quantum_number_f.push_back(ket->get_quantum_number_f());
73 9716 : state_index_to_quantum_number_m.push_back(ket->get_quantum_number_m());
74 9716 : state_index_to_parity.push_back(ket->get_parity());
75 9716 : ket_to_ket_index[ket] = index++;
76 9716 : if (ket->get_quantum_number_f() == std::numeric_limits<real_t>::max()) {
77 8494 : _has_quantum_number_f = false;
78 : }
79 9716 : if (ket->get_quantum_number_m() == std::numeric_limits<real_t>::max()) {
80 0 : _has_quantum_number_m = false;
81 : }
82 9716 : if (ket->get_parity() == Parity::UNKNOWN) {
83 8494 : _has_parity = false;
84 : }
85 : }
86 41 : state_index_to_ket_index.resize(this->kets.size());
87 41 : std::iota(state_index_to_ket_index.begin(), state_index_to_ket_index.end(), 0);
88 41 : ket_index_to_state_index.resize(this->kets.size());
89 41 : std::iota(ket_index_to_state_index.begin(), ket_index_to_state_index.end(), 0);
90 41 : coefficients.matrix.setIdentity();
91 41 : }
92 :
93 : template <typename Derived>
94 9 : bool Basis<Derived>::has_quantum_number_f() const {
95 9 : return _has_quantum_number_f;
96 : }
97 :
98 : template <typename Derived>
99 18211 : bool Basis<Derived>::has_quantum_number_m() const {
100 18211 : return _has_quantum_number_m;
101 : }
102 :
103 : template <typename Derived>
104 9 : bool Basis<Derived>::has_parity() const {
105 9 : return _has_parity;
106 : }
107 :
108 : template <typename Derived>
109 157 : const Derived &Basis<Derived>::derived() const {
110 157 : return static_cast<const Derived &>(*this);
111 : }
112 :
113 : template <typename Derived>
114 73 : const typename Basis<Derived>::ketvec_t &Basis<Derived>::get_kets() const {
115 73 : return kets;
116 : }
117 :
118 : template <typename Derived>
119 : const Eigen::SparseMatrix<typename Basis<Derived>::scalar_t, Eigen::RowMajor> &
120 654 : Basis<Derived>::get_coefficients() const {
121 654 : return coefficients.matrix;
122 : }
123 :
124 : template <typename Derived>
125 : Eigen::SparseMatrix<typename Basis<Derived>::scalar_t, Eigen::RowMajor> &
126 0 : Basis<Derived>::get_coefficients() {
127 0 : return coefficients.matrix;
128 : }
129 :
130 : template <typename Derived>
131 0 : void Basis<Derived>::set_coefficients(
132 : const Eigen::SparseMatrix<scalar_t, Eigen::RowMajor> &values) {
133 0 : if (values.rows() != coefficients.matrix.rows()) {
134 0 : throw std::invalid_argument("Incompatible number of rows.");
135 : }
136 0 : if (values.cols() != coefficients.matrix.cols()) {
137 0 : throw std::invalid_argument("Incompatible number of columns.");
138 : }
139 :
140 0 : coefficients.matrix = values;
141 :
142 0 : std::fill(ket_index_to_state_index.begin(), ket_index_to_state_index.end(),
143 0 : std::numeric_limits<int>::max());
144 0 : std::fill(state_index_to_ket_index.begin(), state_index_to_ket_index.end(),
145 0 : std::numeric_limits<int>::max());
146 0 : std::fill(state_index_to_quantum_number_f.begin(), state_index_to_quantum_number_f.end(),
147 0 : std::numeric_limits<real_t>::max());
148 0 : std::fill(state_index_to_quantum_number_m.begin(), state_index_to_quantum_number_m.end(),
149 0 : std::numeric_limits<real_t>::max());
150 0 : std::fill(state_index_to_parity.begin(), state_index_to_parity.end(), Parity::UNKNOWN);
151 0 : _has_quantum_number_f = false;
152 0 : _has_quantum_number_m = false;
153 0 : _has_parity = false;
154 0 : }
155 :
156 : template <typename Derived>
157 34 : int Basis<Derived>::get_ket_index_from_ket(std::shared_ptr<const ket_t> ket) const {
158 34 : if (ket_to_ket_index.count(ket) == 0) {
159 0 : return -1;
160 : }
161 34 : return ket_to_ket_index.at(ket);
162 : }
163 :
164 : template <typename Derived>
165 : Eigen::VectorX<typename Basis<Derived>::scalar_t>
166 11 : Basis<Derived>::get_amplitudes(std::shared_ptr<const ket_t> ket) const {
167 11 : int ket_index = get_ket_index_from_ket(ket);
168 11 : if (ket_index < 0) {
169 0 : throw std::invalid_argument("The ket does not belong to the basis.");
170 : }
171 : // The following line is a more efficient alternative to
172 : // "get_amplitudes(get_canonical_state_from_ket(ket)).transpose()"
173 22 : return coefficients.matrix.row(ket_index);
174 : }
175 :
176 : template <typename Derived>
177 : Eigen::SparseMatrix<typename Basis<Derived>::scalar_t, Eigen::RowMajor>
178 0 : Basis<Derived>::get_amplitudes(std::shared_ptr<const Derived> other) const {
179 0 : return other->coefficients.matrix.adjoint() * coefficients.matrix;
180 : }
181 :
182 : template <typename Derived>
183 : Eigen::VectorX<typename Basis<Derived>::real_t>
184 11 : Basis<Derived>::get_overlaps(std::shared_ptr<const ket_t> ket) const {
185 11 : return get_amplitudes(ket).cwiseAbs2();
186 : }
187 :
188 : template <typename Derived>
189 : Eigen::SparseMatrix<typename Basis<Derived>::real_t, Eigen::RowMajor>
190 0 : Basis<Derived>::get_overlaps(std::shared_ptr<const Derived> other) const {
191 0 : return get_amplitudes(other).cwiseAbs2();
192 : }
193 :
194 : template <typename Derived>
195 0 : typename Basis<Derived>::real_t Basis<Derived>::get_quantum_number_f(size_t state_index) const {
196 0 : real_t quantum_number_f = state_index_to_quantum_number_f.at(state_index);
197 0 : if (quantum_number_f == std::numeric_limits<real_t>::max()) {
198 0 : throw std::invalid_argument("The state does not have a well-defined quantum number f.");
199 : }
200 0 : return quantum_number_f;
201 : }
202 :
203 : template <typename Derived>
204 18244 : typename Basis<Derived>::real_t Basis<Derived>::get_quantum_number_m(size_t state_index) const {
205 18244 : real_t quantum_number_m = state_index_to_quantum_number_m.at(state_index);
206 18244 : if (quantum_number_m == std::numeric_limits<real_t>::max()) {
207 0 : throw std::invalid_argument("The state does not have a well-defined quantum number m.");
208 : }
209 18244 : return quantum_number_m;
210 : }
211 :
212 : template <typename Derived>
213 43 : Parity Basis<Derived>::get_parity(size_t state_index) const {
214 43 : Parity parity = state_index_to_parity.at(state_index);
215 43 : if (parity == Parity::UNKNOWN) {
216 0 : throw std::invalid_argument("The state does not have a well-defined parity.");
217 : }
218 43 : return parity;
219 : }
220 :
221 : template <typename Derived>
222 : std::shared_ptr<const typename Basis<Derived>::ket_t>
223 38 : Basis<Derived>::get_corresponding_ket(size_t state_index) const {
224 38 : size_t ket_index = state_index_to_ket_index.at(state_index);
225 38 : if (ket_index == std::numeric_limits<int>::max()) {
226 0 : throw std::invalid_argument("The state does not belong to a ket in a well-defined way.");
227 : }
228 38 : return kets[ket_index];
229 : }
230 :
231 : template <typename Derived>
232 : std::shared_ptr<const typename Basis<Derived>::ket_t>
233 0 : Basis<Derived>::get_corresponding_ket(std::shared_ptr<const Derived> /*state*/) const {
234 0 : throw std::runtime_error("Not implemented yet.");
235 : }
236 :
237 : template <typename Derived>
238 4 : std::shared_ptr<const Derived> Basis<Derived>::get_state(size_t state_index) const {
239 : // Create a copy of the current object
240 4 : auto restricted = std::make_shared<Derived>(derived());
241 :
242 : // Restrict the copy to the state with the largest overlap
243 4 : restricted->coefficients.matrix = restricted->coefficients.matrix.col(state_index);
244 :
245 4 : std::fill(restricted->ket_index_to_state_index.begin(),
246 4 : restricted->ket_index_to_state_index.end(), std::numeric_limits<int>::max());
247 :
248 4 : size_t ket_index = state_index_to_ket_index[state_index];
249 4 : restricted->state_index_to_ket_index = {ket_index};
250 4 : if (ket_index != std::numeric_limits<int>::max()) {
251 4 : restricted->ket_index_to_state_index[ket_index] = 0;
252 : }
253 :
254 4 : restricted->state_index_to_quantum_number_f = {state_index_to_quantum_number_f[state_index]};
255 4 : restricted->state_index_to_quantum_number_m = {state_index_to_quantum_number_m[state_index]};
256 4 : restricted->state_index_to_parity = {state_index_to_parity[state_index]};
257 :
258 8 : restricted->_has_quantum_number_f =
259 4 : restricted->state_index_to_quantum_number_f[0] != std::numeric_limits<real_t>::max();
260 8 : restricted->_has_quantum_number_m =
261 4 : restricted->state_index_to_quantum_number_m[0] != std::numeric_limits<real_t>::max();
262 4 : restricted->_has_parity = restricted->state_index_to_parity[0] != Parity::UNKNOWN;
263 :
264 8 : return restricted;
265 4 : }
266 :
267 : template <typename Derived>
268 : std::shared_ptr<const typename Basis<Derived>::ket_t>
269 0 : Basis<Derived>::get_ket(size_t ket_index) const {
270 0 : return kets[ket_index];
271 : }
272 :
273 : template <typename Derived>
274 2 : std::shared_ptr<const Derived> Basis<Derived>::get_corresponding_state(size_t ket_index) const {
275 2 : size_t state_index = ket_index_to_state_index.at(ket_index);
276 2 : if (state_index == std::numeric_limits<int>::max()) {
277 0 : throw std::runtime_error("The ket does not belong to a state in a well-defined way.");
278 : }
279 2 : return get_state(state_index);
280 : }
281 :
282 : template <typename Derived>
283 : std::shared_ptr<const Derived>
284 2 : Basis<Derived>::get_corresponding_state(std::shared_ptr<const ket_t> ket) const {
285 2 : int ket_index = get_ket_index_from_ket(ket);
286 2 : if (ket_index < 0) {
287 0 : throw std::invalid_argument("The ket does not belong to the basis.");
288 : }
289 2 : return get_corresponding_state(ket_index);
290 : }
291 :
292 : template <typename Derived>
293 2 : size_t Basis<Derived>::get_corresponding_state_index(size_t ket_index) const {
294 2 : int state_index = ket_index_to_state_index.at(ket_index);
295 2 : if (state_index == std::numeric_limits<int>::max()) {
296 0 : throw std::runtime_error("The ket does not belong to a state in a well-defined way.");
297 : }
298 2 : return state_index;
299 : }
300 :
301 : template <typename Derived>
302 2 : size_t Basis<Derived>::get_corresponding_state_index(std::shared_ptr<const ket_t> ket) const {
303 2 : int ket_index = get_ket_index_from_ket(ket);
304 2 : if (ket_index < 0) {
305 0 : throw std::invalid_argument("The ket does not belong to the basis.");
306 : }
307 2 : return get_corresponding_state_index(ket_index);
308 : }
309 :
310 : template <typename Derived>
311 38 : size_t Basis<Derived>::get_corresponding_ket_index(size_t state_index) const {
312 38 : size_t ket_index = state_index_to_ket_index.at(state_index);
313 38 : if (ket_index == std::numeric_limits<int>::max()) {
314 0 : throw std::runtime_error("The state does not belong to a ket in a well-defined way.");
315 : }
316 38 : return ket_index;
317 : }
318 :
319 : template <typename Derived>
320 0 : size_t Basis<Derived>::get_corresponding_ket_index(std::shared_ptr<const Derived> /*state*/) const {
321 0 : throw std::runtime_error("Not implemented yet.");
322 : }
323 :
324 : template <typename Derived>
325 : std::shared_ptr<const Derived>
326 19 : Basis<Derived>::get_canonical_state_from_ket(size_t ket_index) const {
327 : // Create a copy of the current object
328 19 : auto created = std::make_shared<Derived>(derived());
329 :
330 : // Fill the copy with the state corresponding to the ket index
331 19 : created->coefficients.matrix =
332 38 : Eigen::SparseMatrix<scalar_t, Eigen::RowMajor>(coefficients.matrix.rows(), 1);
333 19 : created->coefficients.matrix.coeffRef(ket_index, 0) = 1;
334 19 : created->coefficients.matrix.makeCompressed();
335 :
336 19 : std::fill(created->ket_index_to_state_index.begin(), created->ket_index_to_state_index.end(),
337 19 : std::numeric_limits<int>::max());
338 19 : created->ket_index_to_state_index[ket_index] = 0;
339 :
340 19 : created->state_index_to_quantum_number_f = {kets[ket_index]->get_quantum_number_f()};
341 19 : created->state_index_to_quantum_number_m = {kets[ket_index]->get_quantum_number_m()};
342 19 : created->state_index_to_parity = {kets[ket_index]->get_parity()};
343 19 : created->state_index_to_ket_index = {ket_index};
344 :
345 38 : created->_has_quantum_number_f =
346 19 : created->state_index_to_quantum_number_f[0] != std::numeric_limits<real_t>::max();
347 38 : created->_has_quantum_number_m =
348 19 : created->state_index_to_quantum_number_m[0] != std::numeric_limits<real_t>::max();
349 19 : created->_has_parity = created->state_index_to_parity[0] != Parity::UNKNOWN;
350 :
351 38 : return created;
352 19 : }
353 :
354 : template <typename Derived>
355 : std::shared_ptr<const Derived>
356 19 : Basis<Derived>::get_canonical_state_from_ket(std::shared_ptr<const ket_t> ket) const {
357 19 : int ket_index = get_ket_index_from_ket(ket);
358 19 : if (ket_index < 0) {
359 0 : throw std::invalid_argument("The ket does not belong to the basis.");
360 : }
361 19 : return get_canonical_state_from_ket(ket_index);
362 : }
363 :
364 : template <typename Derived>
365 6 : typename Basis<Derived>::Iterator Basis<Derived>::begin() const {
366 6 : return kets.begin();
367 : }
368 :
369 : template <typename Derived>
370 6 : typename Basis<Derived>::Iterator Basis<Derived>::end() const {
371 6 : return kets.end();
372 : }
373 :
374 : template <typename Derived>
375 12 : Basis<Derived>::Iterator::Iterator(typename ketvec_t::const_iterator it) : it{std::move(it)} {}
376 :
377 : template <typename Derived>
378 191 : bool Basis<Derived>::Iterator::operator!=(const Iterator &other) const {
379 191 : return other.it != it;
380 : }
381 :
382 : template <typename Derived>
383 185 : std::shared_ptr<const typename Basis<Derived>::ket_t> Basis<Derived>::Iterator::operator*() const {
384 185 : return *it;
385 : }
386 :
387 : template <typename Derived>
388 185 : typename Basis<Derived>::Iterator &Basis<Derived>::Iterator::operator++() {
389 185 : ++it;
390 185 : return *this;
391 : }
392 :
393 : template <typename Derived>
394 3292 : size_t Basis<Derived>::get_number_of_states() const {
395 3292 : return coefficients.matrix.cols();
396 : }
397 :
398 : template <typename Derived>
399 429 : size_t Basis<Derived>::get_number_of_kets() const {
400 429 : return coefficients.matrix.rows();
401 : }
402 :
403 : template <typename Derived>
404 : const Transformation<typename Basis<Derived>::scalar_t> &
405 60 : Basis<Derived>::get_transformation() const {
406 60 : return coefficients;
407 : }
408 :
409 : template <typename Derived>
410 : Transformation<typename Basis<Derived>::scalar_t>
411 0 : Basis<Derived>::get_rotator(real_t alpha, real_t beta, real_t gamma) const {
412 0 : Transformation<scalar_t> transformation{{static_cast<Eigen::Index>(coefficients.matrix.rows()),
413 : static_cast<Eigen::Index>(coefficients.matrix.rows())},
414 : {TransformationType::ROTATE}};
415 :
416 0 : std::vector<Eigen::Triplet<scalar_t>> entries;
417 :
418 0 : for (size_t idx_initial = 0; idx_initial < kets.size(); ++idx_initial) {
419 0 : real_t f = kets[idx_initial]->get_quantum_number_f();
420 0 : real_t m_initial = kets[idx_initial]->get_quantum_number_m();
421 :
422 0 : assert(2 * f == std::floor(2 * f) && f >= 0);
423 0 : assert(2 * m_initial == std::floor(2 * m_initial) && m_initial >= -f && m_initial <= f);
424 :
425 0 : for (real_t m_final = -f; m_final <= f; // NOSONAR m_final is precisely representable
426 : ++m_final) {
427 0 : auto val = wigner::wigner_uppercase_d_matrix<scalar_t>(f, m_initial, m_final, alpha,
428 : beta, gamma);
429 0 : size_t idx_final = get_ket_index_from_ket(
430 0 : kets[idx_initial]->get_ket_for_different_quantum_number_m(m_final));
431 0 : entries.emplace_back(idx_final, idx_initial, val);
432 : }
433 : }
434 :
435 0 : transformation.matrix.setFromTriplets(entries.begin(), entries.end());
436 0 : transformation.matrix.makeCompressed();
437 :
438 0 : return transformation;
439 0 : }
440 :
441 : template <typename Derived>
442 1 : Sorting Basis<Derived>::get_sorter(const std::vector<TransformationType> &labels) const {
443 1 : perform_sorter_checks(labels);
444 :
445 : // Throw a meaningful error if sorting by energy is requested as this might be a common mistake
446 1 : if (std::find(labels.begin(), labels.end(), TransformationType::SORT_BY_ENERGY) !=
447 2 : labels.end()) {
448 0 : throw std::invalid_argument("States do not store the energy and thus can not be sorted by "
449 : "the energy. Use an energy operator instead.");
450 : }
451 :
452 : // Initialize transformation
453 1 : Sorting transformation;
454 1 : transformation.matrix.resize(coefficients.matrix.cols());
455 1 : transformation.matrix.setIdentity();
456 :
457 : // Get the sorter
458 1 : get_sorter_without_checks(labels, transformation);
459 :
460 : // Check if all labels have been used for sorting
461 1 : if (labels != transformation.transformation_type) {
462 0 : throw std::invalid_argument("The states could not be sorted by all the requested labels.");
463 : }
464 :
465 1 : return transformation;
466 0 : }
467 :
468 : template <typename Derived>
469 : std::vector<IndicesOfBlock>
470 1 : Basis<Derived>::get_indices_of_blocks(const std::vector<TransformationType> &labels) const {
471 1 : perform_sorter_checks(labels);
472 :
473 1 : std::set<TransformationType> unique_labels(labels.begin(), labels.end());
474 1 : perform_blocks_checks(unique_labels);
475 :
476 : // Get the blocks
477 1 : IndicesOfBlocksCreator blocks_creator({0, static_cast<size_t>(coefficients.matrix.cols())});
478 1 : get_indices_of_blocks_without_checks(unique_labels, blocks_creator);
479 :
480 2 : return blocks_creator.create();
481 1 : }
482 :
483 : template <typename Derived>
484 33 : void Basis<Derived>::get_sorter_without_checks(const std::vector<TransformationType> &labels,
485 : Sorting &transformation) const {
486 33 : constexpr real_t numerical_precision = 100 * std::numeric_limits<real_t>::epsilon();
487 :
488 33 : int *perm_begin = transformation.matrix.indices().data();
489 33 : int *perm_end = perm_begin + coefficients.matrix.cols();
490 33 : const int *perm_back = perm_end - 1;
491 :
492 : // Sort the vector based on the requested labels
493 41634 : std::stable_sort(perm_begin, perm_end, [&](int a, int b) {
494 14881 : for (const auto &label : labels) {
495 10208 : switch (label) {
496 51 : case TransformationType::SORT_BY_PARITY:
497 51 : if (state_index_to_parity[a] != state_index_to_parity[b]) {
498 5504 : return state_index_to_parity[a] < state_index_to_parity[b];
499 : }
500 31 : break;
501 10157 : case TransformationType::SORT_BY_QUANTUM_NUMBER_M:
502 20314 : if (std::abs(state_index_to_quantum_number_m[a] -
503 20314 : state_index_to_quantum_number_m[b]) > numerical_precision) {
504 5484 : return state_index_to_quantum_number_m[a] < state_index_to_quantum_number_m[b];
505 : }
506 4673 : break;
507 0 : case TransformationType::SORT_BY_QUANTUM_NUMBER_F:
508 0 : if (std::abs(state_index_to_quantum_number_f[a] -
509 0 : state_index_to_quantum_number_f[b]) > numerical_precision) {
510 0 : return state_index_to_quantum_number_f[a] < state_index_to_quantum_number_f[b];
511 : }
512 0 : break;
513 0 : case TransformationType::SORT_BY_KET:
514 0 : if (state_index_to_ket_index[a] != state_index_to_ket_index[b]) {
515 0 : return state_index_to_ket_index[a] < state_index_to_ket_index[b];
516 : }
517 0 : break;
518 0 : default:
519 0 : std::abort(); // Can't happen because of previous checks
520 : }
521 : }
522 4673 : return false; // Elements are equal
523 : });
524 :
525 : // Check for invalid values and add transformation types
526 67 : for (const auto &label : labels) {
527 34 : switch (label) {
528 1 : case TransformationType::SORT_BY_PARITY:
529 1 : if (state_index_to_parity[*perm_back] == Parity::UNKNOWN) {
530 0 : throw std::invalid_argument(
531 : "States cannot be labeled and thus not sorted by the parity.");
532 : }
533 1 : transformation.transformation_type.push_back(TransformationType::SORT_BY_PARITY);
534 1 : break;
535 33 : case TransformationType::SORT_BY_QUANTUM_NUMBER_M:
536 33 : if (state_index_to_quantum_number_m[*perm_back] == std::numeric_limits<real_t>::max()) {
537 0 : throw std::invalid_argument(
538 : "States cannot be labeled and thus not sorted by the quantum number m.");
539 : }
540 33 : transformation.transformation_type.push_back(
541 33 : TransformationType::SORT_BY_QUANTUM_NUMBER_M);
542 33 : break;
543 0 : case TransformationType::SORT_BY_QUANTUM_NUMBER_F:
544 0 : if (state_index_to_quantum_number_f[*perm_back] == std::numeric_limits<real_t>::max()) {
545 0 : throw std::invalid_argument(
546 : "States cannot be labeled and thus not sorted by the quantum number f.");
547 : }
548 0 : transformation.transformation_type.push_back(
549 0 : TransformationType::SORT_BY_QUANTUM_NUMBER_F);
550 0 : break;
551 0 : case TransformationType::SORT_BY_KET:
552 0 : if (state_index_to_ket_index[*perm_back] == std::numeric_limits<int>::max()) {
553 0 : throw std::invalid_argument(
554 : "States cannot be labeled and thus not sorted by kets.");
555 : }
556 0 : transformation.transformation_type.push_back(TransformationType::SORT_BY_KET);
557 0 : break;
558 0 : default:
559 0 : std::abort(); // Can't happen because of previous checks
560 : }
561 : }
562 33 : }
563 :
564 : template <typename Derived>
565 33 : void Basis<Derived>::get_indices_of_blocks_without_checks(
566 : const std::set<TransformationType> &unique_labels,
567 : IndicesOfBlocksCreator &blocks_creator) const {
568 33 : constexpr real_t numerical_precision = 100 * std::numeric_limits<real_t>::epsilon();
569 :
570 33 : auto last_quantum_number_f = state_index_to_quantum_number_f[0];
571 33 : auto last_quantum_number_m = state_index_to_quantum_number_m[0];
572 33 : auto last_parity = state_index_to_parity[0];
573 33 : auto last_ket = state_index_to_ket_index[0];
574 :
575 1917 : for (int i = 0; i < coefficients.matrix.cols(); ++i) {
576 3685 : for (auto label : unique_labels) {
577 1895 : if (label == TransformationType::SORT_BY_QUANTUM_NUMBER_F &&
578 0 : std::abs(state_index_to_quantum_number_f[i] - last_quantum_number_f) >
579 : numerical_precision) {
580 0 : blocks_creator.add(i);
581 0 : break;
582 : }
583 3779 : if (label == TransformationType::SORT_BY_QUANTUM_NUMBER_M &&
584 1884 : std::abs(state_index_to_quantum_number_m[i] - last_quantum_number_m) >
585 : numerical_precision) {
586 94 : blocks_creator.add(i);
587 94 : break;
588 : }
589 1812 : if (label == TransformationType::SORT_BY_PARITY &&
590 11 : state_index_to_parity[i] != last_parity) {
591 0 : blocks_creator.add(i);
592 0 : break;
593 : }
594 1801 : if (label == TransformationType::SORT_BY_KET &&
595 1801 : state_index_to_ket_index[i] != last_ket &&
596 0 : last_ket != std::numeric_limits<int>::max()) {
597 0 : blocks_creator.add(i);
598 0 : break;
599 : }
600 : }
601 1884 : last_quantum_number_f = state_index_to_quantum_number_f[i];
602 1884 : last_quantum_number_m = state_index_to_quantum_number_m[i];
603 1884 : last_parity = state_index_to_parity[i];
604 1884 : last_ket = state_index_to_ket_index[i];
605 : }
606 33 : }
607 :
608 : template <typename Derived>
609 75 : std::shared_ptr<const Derived> Basis<Derived>::transformed(const Sorting &transformation) const {
610 : // Create a copy of the current object
611 75 : auto transformed = std::make_shared<Derived>(derived());
612 :
613 75 : if (coefficients.matrix.cols() == 0) {
614 0 : return transformed;
615 : }
616 :
617 : // Apply the transformation
618 75 : transformed->coefficients.matrix = coefficients.matrix * transformation.matrix;
619 75 : transformed->coefficients.transformation_type = transformation.transformation_type;
620 :
621 75 : transformed->state_index_to_quantum_number_f.resize(transformation.matrix.size());
622 75 : transformed->state_index_to_quantum_number_m.resize(transformation.matrix.size());
623 75 : transformed->state_index_to_parity.resize(transformation.matrix.size());
624 75 : transformed->state_index_to_ket_index.resize(transformation.matrix.size());
625 :
626 4982 : for (int i = 0; i < transformation.matrix.size(); ++i) {
627 4907 : transformed->state_index_to_quantum_number_f[i] =
628 4907 : state_index_to_quantum_number_f[transformation.matrix.indices()[i]];
629 4907 : transformed->state_index_to_quantum_number_m[i] =
630 4907 : state_index_to_quantum_number_m[transformation.matrix.indices()[i]];
631 4907 : transformed->state_index_to_parity[i] =
632 4907 : state_index_to_parity[transformation.matrix.indices()[i]];
633 :
634 4907 : size_t ket_index = state_index_to_ket_index[transformation.matrix.indices()[i]];
635 4907 : transformed->state_index_to_ket_index[i] = ket_index;
636 4907 : if (ket_index != std::numeric_limits<int>::max()) {
637 4907 : transformed->ket_index_to_state_index[ket_index] = i;
638 : }
639 : }
640 :
641 75 : return transformed;
642 75 : }
643 :
644 : template <typename Derived>
645 : std::shared_ptr<const Derived>
646 59 : Basis<Derived>::transformed(const Transformation<scalar_t> &transformation) const {
647 : // TODO why is "numerical_precision = 100 * std::sqrt(coefficients.matrix.rows()) *
648 : // std::numeric_limits<real_t>::epsilon()" too small for figuring out whether m is conserved?
649 59 : real_t numerical_precision = 0.001;
650 :
651 : // If the transformation is a rotation, it should be a rotation and nothing else
652 59 : bool is_rotation = false;
653 118 : for (auto t : transformation.transformation_type) {
654 59 : if (t == TransformationType::ROTATE) {
655 0 : is_rotation = true;
656 0 : break;
657 : }
658 : }
659 59 : if (is_rotation && transformation.transformation_type.size() != 1) {
660 0 : throw std::invalid_argument("A rotation can not be combined with other transformations.");
661 : }
662 :
663 : // To apply a rotation, the object must only be sorted but other transformations are not allowed
664 59 : if (is_rotation) {
665 0 : for (auto t : coefficients.transformation_type) {
666 0 : if (!utils::is_sorting(t)) {
667 0 : throw std::runtime_error(
668 : "If the object was transformed by a different transformation "
669 : "than sorting, it can not be rotated.");
670 : }
671 : }
672 : }
673 :
674 : // Create a copy of the current object
675 59 : auto transformed = std::make_shared<Derived>(derived());
676 :
677 59 : if (coefficients.matrix.cols() == 0) {
678 0 : return transformed;
679 : }
680 :
681 : // Apply the transformation
682 : // If a quantum number turns out to be conserved by the transformation, it will be
683 : // rounded to the nearest half integer to avoid loss of numerical_precision.
684 59 : transformed->coefficients.matrix = coefficients.matrix * transformation.matrix;
685 59 : transformed->coefficients.transformation_type = transformation.transformation_type;
686 :
687 59 : Eigen::SparseMatrix<real_t> probs = transformation.matrix.cwiseAbs2().transpose();
688 :
689 : {
690 118 : auto map = Eigen::Map<const Eigen::VectorX<real_t>>(state_index_to_quantum_number_f.data(),
691 59 : state_index_to_quantum_number_f.size());
692 59 : Eigen::VectorX<real_t> val = probs * map;
693 59 : Eigen::VectorX<real_t> sq = probs * map.cwiseAbs2();
694 59 : Eigen::VectorX<real_t> diff = (val.cwiseAbs2() - sq).cwiseAbs();
695 59 : transformed->state_index_to_quantum_number_f.resize(probs.rows());
696 :
697 2185 : for (size_t i = 0; i < transformed->state_index_to_quantum_number_f.size(); ++i) {
698 2126 : if (diff[i] < numerical_precision) {
699 379 : transformed->state_index_to_quantum_number_f[i] = std::round(val[i] * 2) / 2;
700 : } else {
701 1747 : transformed->state_index_to_quantum_number_f[i] =
702 1747 : std::numeric_limits<real_t>::max();
703 1747 : transformed->_has_quantum_number_f = false;
704 : }
705 : }
706 59 : }
707 :
708 : {
709 118 : auto map = Eigen::Map<const Eigen::VectorX<real_t>>(state_index_to_quantum_number_m.data(),
710 59 : state_index_to_quantum_number_m.size());
711 59 : Eigen::VectorX<real_t> val = probs * map;
712 59 : Eigen::VectorX<real_t> sq = probs * map.cwiseAbs2();
713 59 : Eigen::VectorX<real_t> diff = (val.cwiseAbs2() - sq).cwiseAbs();
714 59 : transformed->state_index_to_quantum_number_m.resize(probs.rows());
715 :
716 2185 : for (size_t i = 0; i < transformed->state_index_to_quantum_number_m.size(); ++i) {
717 2126 : if (diff[i] < numerical_precision) {
718 1774 : transformed->state_index_to_quantum_number_m[i] = std::round(val[i] * 2) / 2;
719 : } else {
720 352 : transformed->state_index_to_quantum_number_m[i] =
721 352 : std::numeric_limits<real_t>::max();
722 352 : transformed->_has_quantum_number_m = false;
723 : }
724 : }
725 59 : }
726 :
727 : {
728 : using utype = std::underlying_type<Parity>::type;
729 59 : Eigen::VectorX<real_t> map(state_index_to_parity.size());
730 2503 : for (size_t i = 0; i < state_index_to_parity.size(); ++i) {
731 2444 : map[i] = static_cast<utype>(state_index_to_parity[i]);
732 : }
733 59 : Eigen::VectorX<real_t> val = probs * map;
734 59 : Eigen::VectorX<real_t> sq = probs * map.cwiseAbs2();
735 59 : Eigen::VectorX<real_t> diff = (val.cwiseAbs2() - sq).cwiseAbs();
736 59 : transformed->state_index_to_parity.resize(probs.rows());
737 :
738 2185 : for (size_t i = 0; i < transformed->state_index_to_parity.size(); ++i) {
739 2126 : if (diff[i] < numerical_precision) {
740 798 : transformed->state_index_to_parity[i] = static_cast<Parity>(std::lround(val[i]));
741 : } else {
742 1328 : transformed->state_index_to_parity[i] = Parity::UNKNOWN;
743 1328 : transformed->_has_parity = false;
744 : }
745 : }
746 59 : }
747 :
748 : {
749 : // In the following, we obtain a bijective map between state index and ket index.
750 :
751 : // Find the maximum value in each row and column
752 59 : std::vector<real_t> max_in_row(transformed->coefficients.matrix.rows(), 0);
753 59 : std::vector<real_t> max_in_col(transformed->coefficients.matrix.cols(), 0);
754 2503 : for (int row = 0; row < transformed->coefficients.matrix.outerSize(); ++row) {
755 2444 : for (typename Eigen::SparseMatrix<scalar_t, Eigen::RowMajor>::InnerIterator it(
756 2444 : transformed->coefficients.matrix, row);
757 45087 : it; ++it) {
758 42643 : real_t val = std::pow(std::abs(it.value()), 2);
759 42642 : max_in_row[row] = std::max(max_in_row[row], val);
760 42642 : max_in_col[it.col()] = std::max(max_in_col[it.col()], val);
761 : }
762 : }
763 :
764 : // Use the maximum values to define a cost for a sub-optimal mapping
765 59 : std::vector<real_t> costs;
766 59 : std::vector<std::pair<int, int>> mappings;
767 59 : costs.reserve(transformed->coefficients.matrix.nonZeros());
768 59 : mappings.reserve(transformed->coefficients.matrix.nonZeros());
769 2503 : for (int row = 0; row < transformed->coefficients.matrix.outerSize(); ++row) {
770 2444 : for (typename Eigen::SparseMatrix<scalar_t, Eigen::RowMajor>::InnerIterator it(
771 2444 : transformed->coefficients.matrix, row);
772 45044 : it; ++it) {
773 42604 : real_t val = std::pow(std::abs(it.value()), 2);
774 42611 : real_t cost = max_in_row[row] + max_in_col[it.col()] - 2 * val;
775 42577 : costs.push_back(cost);
776 42576 : mappings.push_back({row, it.col()});
777 : }
778 : }
779 :
780 : // Obtain from the costs in which order the mappings should be considered
781 59 : std::vector<size_t> order(costs.size());
782 59 : std::iota(order.begin(), order.end(), 0);
783 59 : std::sort(order.begin(), order.end(),
784 531377 : [&](size_t a, size_t b) { return costs[a] < costs[b]; });
785 :
786 : // Fill ket_index_to_state_index with invalid values as there can be more kets than states
787 59 : std::fill(transformed->ket_index_to_state_index.begin(),
788 59 : transformed->ket_index_to_state_index.end(), std::numeric_limits<int>::max());
789 :
790 : // Generate the bijective map
791 59 : std::vector<bool> row_used(transformed->coefficients.matrix.rows(), false);
792 59 : std::vector<bool> col_used(transformed->coefficients.matrix.cols(), false);
793 59 : int num_used = 0;
794 5368 : for (size_t idx : order) {
795 5366 : int row = mappings[idx].first; // corresponds to the ket index
796 5366 : int col = mappings[idx].second; // corresponds to the state index
797 5366 : if (!row_used[row] && !col_used[col]) {
798 2126 : row_used[row] = true;
799 2126 : col_used[col] = true;
800 2126 : num_used++;
801 2126 : transformed->state_index_to_ket_index[col] = row;
802 2126 : transformed->ket_index_to_state_index[row] = col;
803 : }
804 5366 : if (num_used == transformed->coefficients.matrix.cols()) {
805 57 : break;
806 : }
807 : }
808 59 : assert(num_used == transformed->coefficients.matrix.cols());
809 59 : }
810 :
811 59 : return transformed;
812 59 : }
813 :
814 : template <typename Derived>
815 9784 : size_t Basis<Derived>::hash::operator()(const std::shared_ptr<const ket_t> &k) const {
816 9784 : return typename ket_t::hash()(*k);
817 : }
818 :
819 : template <typename Derived>
820 68 : bool Basis<Derived>::equal_to::operator()(const std::shared_ptr<const ket_t> &lhs,
821 : const std::shared_ptr<const ket_t> &rhs) const {
822 68 : return *lhs == *rhs;
823 : }
824 :
825 : // Explicit instantiations
826 : template class Basis<BasisAtom<double>>;
827 : template class Basis<BasisAtom<std::complex<double>>>;
828 : template class Basis<BasisPair<double>>;
829 : template class Basis<BasisPair<std::complex<double>>>;
830 : } // namespace pairinteraction
|
