Author:
Bertoni Alberto,Carpentieri Marco
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference39 articles.
1. Elementary gates for quantum computation;Barenco;Phys. Rev. A,1995
2. Quantum mechanical hamiltonian models of turing machines;Benioff;J. Statist. Phys.,1982
3. Quantum computation and information;Bennet;Physics Today,1995
4. Logical reversibility of computation;Bennet;IBM J. Res. Develop.,1973
5. Strengths and weaknesses of quantum computing;Bennet;SIAM J. Comput.,1994
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Energy complexity of regular languages;Theoretical Computer Science;2024-01
2. Reversible Computations of One-Way Counter Automata;Electronic Proceedings in Theoretical Computer Science;2022-08-27
3. Energy Complexity of Regular Language Recognition;Implementation and Application of Automata;2022
4. Guest Column;ACM SIGACT News;2021-10-17
5. An Enhanced Photonic Quantum Finite Automaton;Applied Sciences;2021-09-21