Table 3 Circuit depth comparison of the different TDS algorithms investigated and shown in Fig. 4 for the 1D Heisenberg model

From: Efficient and practical Hamiltonian simulation from time-dependent product formulas

Algorithm

2-qubit gate depth

CNOT depth

# steps in Fig. 4

Trotter 1

2N

6N

15

Trotter 2

2N + 1

6N + 3

15

Trotter 4

10N + 1

30N + 3

3

optimised Trotter 8

30N + 1

90N + 3

1

THRIFT 1

2N

6N + 3

15

THRIFT 2

2N + 1

6N + 3

15

THRIFT 4

10N + 1

30N + 3

3

optimised THRIFT 8

30N + 1

90N + 3

1

optimised small A 4

12N

36N

2

  1. The first column shows the 2-qubit depth of the circuit corresponding to N Trotter steps in terms of arbitrary 2-qubit gates. The second column shows the corresponding cost in terms of CNOT gates. Finally, the third column gives the number of Trotter steps used in Fig. 4, which correspond to a fixed budget of arbitrary 2-qubit gates of 31.
Back to article page