Revealing symmetries in quantum computing for many-body systems
Leeuwen, R. V. (2024). Revealing symmetries in quantum computing for many-body systems. New Journal of Physics, 26, Article 103023. https://doi.org/10.1088/1367-2630/ad8677
Julkaistu sarjassa
New Journal of PhysicsTekijät
Päivämäärä
2024Tekijänoikeudet
© 2024 The Author(s). Published by IOP Publishing Ltd on behalf of the Institute of Physics and Deutsche Physikalische Gesellschaft
We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan–Wigner form in which they can act on multi-qubit states. Symmetries, such as point-group symmetries in molecules, are apparent in the standard second quantized form of the Hamiltonian. They are, however, masked when the Hamiltonian is translated into a Pauli matrix representation required for its operation on qubits. To reveal these symmetries we prove a general theorem that provides a straightforward method to calculate the transformation of Pauli tensor strings under symmetry operations. They are a subgroup of the Clifford group transformations and induce a corresponding group representation inside the symplectic matrices. We finally give a simplified derivation of an affine qubit encoding scheme which allows for the removal of qubits due to Boolean symmetries and thus reduces effort in quantum computations for many-body systems.
Julkaisija
IOP PublishingISSN Hae Julkaisufoorumista
1367-2630Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/243860845
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Rahoittaja(t)
Suomen AkatemiaRahoitusohjelmat(t)
Akatemiahanke, SALisätietoja rahoituksesta
I wish to acknowledge support from the Finnish Academy under Project Number 356906.Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Software architecture for quantum computing systems : a systematic review
Khan, Arif Ali; Ahmad, Aakash; Waseem, Muhammad; Liang, Peng; Fahmideh, Mahdi; Mikkonen, Tommi; Abrahamsson, Pekka (Elsevier BV, 2023)Quantum computing systems rely on the principles of quantum mechanics to perform a multitude of computationally challenging tasks more efficiently than their classical counterparts. The architecture of software-intensive ... -
Qubernetes : Towards a unified cloud-native execution platform for hybrid classic-quantum computing
Stirbu, Vlad; Kinanen, Otso; Haghparast, Majid; Mikkonen, Tommi (Elsevier, 2024)Context: The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains. The ability of quantum computers to scale computations ... -
Toward Quaternary QCA : Novel Majority and XOR Fuzzy Gates
Akbari-Hasanjani, Reza; Sabbaghi-Nadooshan, Reza; Haghparast, Majid (Institute of Electrical and Electronics Engineers (IEEE), 2022)As an emerging nanotechnology, quantum-dot cellular automata (QCA) has been considered an alternative to CMOS technology that suffers from problems such as leakage current. Moreover, QCA is suitable for multi-valued logic ... -
Design and simulation of QCA-based 3-bit binary to gray and vice versa code converter in reversible and non-reversible mode
Safaiezadeh, Behrouz; Mahdipour, Ebrahim; Haghparast, Majid; Sayedsalehi, Samira; Hosseinzadeh, Mehdi (Elsevier, 2022)The current Very Large-Scale Integration (VLSI) technology has reached its peak due to the fundamental physical limits of Complementary Metal-Oxide-Semiconductor (CMOS). Quantum-dot Cellular Automata (QCA) is considered a ... -
Liquifying Quantum-Classical Software-Intensive System of Systems
Aparicio-Morales, Álvaro M.; Haghparast, Majid; Mäkitalo, Niko; Garcia-Alonso, Jose; Berrocal, Javier; Stirbu, Vlad; Mikkonen, Tommi; Murillo, Juan Manuel (IEEE, 2024)Software-Intensive Systems are applications that use a high amount of computational resources for the execution of complex tasks in which a constant flow of information is needed. In the current conception of the computing ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.