Fabio Tarocco- Master of Science
- PhD Student at University of L'Aquila
Fabio Tarocco
- Master of Science
- PhD Student at University of L'Aquila
Quantum Computing Ph.D Student at DISIM @Univaq
About
3
Publications
430
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
7
Citations
Introduction
Ph.D. Student @UNIVAQ (DISIM)
Research topic: Quantum Comuting ⚛️, Quantum Chemistry 🧪, Tensor Network Algorithms 🌐, and Algorithms Design ⚙️.
I’m currently working on:
-Single-reference Quantum Chemistry methods for Ground state systems
-Variational Quantum Algorithms for Ground State resolution
-DMRG
-Quantum Information Theory
-Ansatz design
I’m exploring:
-Quantum Chemistry MR methods for Excited systems
-Active space selection methods
Skills and Expertise
Current institution
Publications
Publications (3)
![Figure 5: Additional layer with entangling map [0, 1],[1, 2],[2, 3]...](publication/382884745/figure/fig2/AS:11431281269775553@1722922448989/Additional-layer-with-entangling-map-0-1-1-2-2-3-where-each-entangler-is-an_Q320.jpg)
Quantum algorithms based on the variational principle have found applications in diverse areas with a huge flexibility. But as the circuit size increases the variational landscapes become flattened, causing the so-called Barren plateau phenomena. This will lead to an increased difficulty in the optimization phase, due to the reduction of the cost f...
Distance measures provide the foundation for many popular algorithms in Machine Learning and Pattern Recognition. Different notions of distance can be used depending on the types of the data the algorithm is working on. For graph-shaped data, an important notion is the Graph Edit Distance (GED) that measures the degree of (dis)similarity between tw...
Distance measures provide the foundation for many popular algorithms in Machine Learning and Pattern Recognition. Different notions of distance can be used depending on the types of the data the algorithm is working on. For graph-shaped data, an important notion is the Graph Edit Distance (GED) that measures the degree of (dis)similarity between tw...
