Qutrit representation of quantum images : new quantum ternary circuit design
Taheri Monfared, A., Ciriani, V., & Haghparast, M. (2024). Qutrit representation of quantum images : new quantum ternary circuit design. Quantum Information Processing, 23(8), Article 288. https://doi.org/10.1007/s11128-024-04484-w
Julkaistu sarjassa
Quantum Information ProcessingPäivämäärä
2024Tekijänoikeudet
© 2024 the Authors
Quantum computation is growing in significance and proving to be a powerful tool in meeting the high real-time computational demands of classical digital image processing. However, extensive research has been done on quantum image processing, mainly rooted in binary quantum systems. In this paper, we propose a new quantum ternary image circuit based on the analysis of the existing qutrit representation of quantum images. The proposed design utilizes ternary shift gates and ternary Muthukrishnan–Stroud gates, with the belief that this circuit can be used for ternary quantum image processing. This study makes a significant improvement compared to the existing counterpart in terms of quantum cost, the number of constant inputs, and garbage outputs, which are all essential parameters in quantum circuit design.
Julkaisija
SpringerISSN Hae Julkaisufoorumista
1570-0755Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/233323357
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Rahoittaja(t)
Suomen AkatemiaRahoitusohjelmat(t)
Akatemiahanke, SALisätietoja rahoituksesta
Majid Haghparast acknowledges supports from the Academy of Finland (Project DEQSE 349945) and Business Finland (Project TORQS 8582/31/2022). Open Access funding is provided by the University of Jyväskylä (JYU). Also this work was supported in part by project SERICS (PE00000014) under the NRRP MUR program funded by the EU - NGEU.Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Efficient Design of Ternary Reversible T Flip-Flop Using Quantum Dot Cellular Automata
Fattahi, Arash; Sabbaghi-Nadooshan, Reza; Moosazadeh, Tohid; Haghparast, Majid (Springer Nature, 2024)Reversible logic circuits are an exciting solution for designing efficient sequential and combinational circuits. Reducing the size of transistors to nanoscale has created new challenges and issues in the field-effect ... -
Compact Quantum Circuit Design of PUFFIN and PRINT Lightweight Ciphers for Quantum Key Recovery Attack
Saravanan, P.; Jenitha, J.; Sanjana, S.; Haghparast, Majid (Institute of Electrical and Electronics Engineers (IEEE), 2023)Quantum computing plays a vital role in the next generation computing platforms as researchers have achieved quantum supremacy by proving that quantum computers can outperform classical computers. These high performance ... -
Novel qutrit circuit design for multiplexer, De-multiplexer, and decoder
Taheri Monfared, Asma; Ciriani, Valentina; Kettunen, Lauri; Haghparast, Majid (Springer, 2023)Designing conventional circuits present many challenges, including minimizing internal power dissipation. An approach to overcoming this problem is utilizing quantum technology, which has attracted significant attention ... -
Simple information-processing tasks with unbounded quantum advantage
Heinosaari, Teiko; Kerppo, Oskari; Leppäjärvi, Leevi; Plávala, Martin (American Physical Society, 2024)Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by ... -
A Novel and Efficient square root Computation Quantum Circuit for Floating-point Standard
Gayathri, S. S.; Kumar, R.; Haghparast, Majid; Dhanalakshmi, Samiappan (Springer, 2022)It is imperative that quantum computing devices perform floating-point arithmetic operations. This paper presents a circuit design for floating-point square root operations designed using classical Babylonian algorithm. ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.