Genetic algorithm for qubits initialisation in noisy intermediate-scale quantum machines

Dahi, Zakaria Abd El Moiz; Chicano, Francisco; Luque, Gabriel; Alba, Enrique

doi:10.1145/3512290.3528830

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are numerous quantum simulators that operate both sequentially and in parallel [23]. A survey of the main types of existing simulators can be found in [24]. Most of these quantum simulators evolve the full quantum state using matrices.…”

Section: Related Workmentioning

confidence: 99%

Efficient quantum circuit contraction using Tensor Decision Diagrams

Lopez-Oliva,

Badia,

Castillo

2024

Preprint

View full text Add to dashboard Cite

Quantum computing holds the potential to solve complex problems currently beyond the capabilities of classical computers by exploiting the principles of quantum mechanics. However, due to the immaturity of such computers and the inability to know the state of the circuit during execution, efficient quantum simulators on classical computers are needed. This paper compares different methods for the contraction of quantum circuits represented as tensor networks. Tensor Decision Diagrams (TDD) are used to implement two contraction ordering methods that exploit the structure of the circuits to reduce temporal and spatial costs. Experimental results show that these methods improve other well established approaches and that they are faster that other well-known simulation tools based on other circuit representations. In addition, an analysis of different implementations of the same quantum algorithm highlights the impact of gate sets on contraction efficiency.

show abstract

Section: Related Workmentioning

confidence: 99%