Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Stefano Mangini

dblp:298/9218 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0002-0056-0660ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › quantum computer architecture
quantum architecture search
0.912025
TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search · NeurIPS 2025
Emerging computing paradigms
quantum computer architecture
0.912025
TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search · NeurIPS 2025
Emerging computing paradigms
quantum computing
0.312025
TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search · NeurIPS 2025
Emerging computing paradigms › quantum computing
variational quantum algorithm
0.312025
TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.7matrix product state · 1.7tensor networks · 0.9tensor network · 0.9
YearPublicationVenuePosition
2025 TensorRL-QAS: Reinforcement learning with tensor networks for improved quantum architecture search
abstract
Variational quantum algorithms hold the promise to address meaningful quantum problems already on noisy intermediate-scale quantum hardware. In spite of the promise, they face the challenge of designing quantum circuits that both solve the target problem and comply with device limitations. Quantum architecture search (QAS) automates the design process of quantum circuits, with reinforcement learning (RL) emerging as a promising approach. Yet, RL-based QAS methods encounter significant scalability issues, as computational and training costs grow rapidly with the number of qubits, circuit depth, and hardware noise. To address these challenges, we introduce TensorRL-QAS, an improved framework that combines tensor network methods with RL for QAS. By warm-starting the QAS with a matrix product state approximation of the target solution, TensorRL-QAS effectively narrows the search space to physically meaningful circuits and accelerates the convergence to the desired solution. Tested on several quantum chemistry problems of up to 12-qubit, TensorRL-QAS achieves up to a 10-fold reduction in CNOT count and circuit depth compared to baseline methods, while maintaining or surpassing chemical accuracy. It reduces classical optimizer function evaluation by up to 100-fold, accelerates training episodes by up to 98\%, and can achieve 50\% success probability for 10-qubit systems, far exceeding the $<$1\% rates of baseline. Robustness and versatility are demonstrated both in the noiseless and noisy scenarios, where we report a simulation of an 8-qubit system. Furthermore, TensorRL-QAS demonstrates effectiveness on systems on 20-qubit quantum systems, positioning it as a state-of-the-art quantum circuit discovery framework for near-term hardware and beyond.
Akash Kundu, Stefano Mangini
NeurIPS2
2022 The Dawn of Quantum Natural Language Processing
abstract
In this paper, we discuss the initial attempts at boosting understanding human language based on deep-learning models with quantum computing. We successfully train a quantum-enhanced Long Short-Term Memory network to perform the parts-of-speech tagging task via numerical simulations. Moreover, a quantum-enhanced Transformer is proposed to perform the sentiment analysis based on the existing dataset.
Riccardo Di Sipio, Jia-Hong Huang, Samuel Yen-Chi Chen, Stefano Mangini, Marcel Worring
ICASSP4
2022 Quantum variational learning for entanglement witnessing
abstract
Several proposals have been recently introduced to implement Quantum Machine Learning (QML) algorithms for the analysis of classical data sets employing variational learning means. There has been, however, a limited amount of work on the characterization and analysis of quantum data by means of these techniques, so far. This work focuses on one such ambitious goal, namely the potential implementation of quantum algorithms allowing to properly classify quantum states defined over a single register of$n$qubits, based on their degree of entanglement. This is a notoriously hard task to be performed on classical hardware, due to the exponential scaling of the corresponding Hilbert space as 2n. We exploit the notion of “entanglement witness”, i.e., an operator whose expectation values allow to identify certain specific states as entangled. More in detail, we made use of Quantum Neural Networks (QNNs) in order to successfully learn how to reproduce the action of an entanglement witness. This work may pave the way to an efficient combination of QML algorithms and quantum information protocols, possibly outperforming classical approaches to analyse quantum data. All these topics are discussed and properly demonstrated through a simulation of the related quantum circuit model.
Francesco Scala, Stefano Mangini, Chiara Macchiavello, Daniele Bajoni, Dario Gerace
IJCNN2