Stefano Barison
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stefano Barison has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Carleo
École Polytechnique Fédérale de Lausanne (EPFL)
3 shared publications - Mario Motta
IBM Quantum IBM T. J. Watson Research Center 10598 Yorktown Heights NY USA
3 shared publications - Andrea Giachero
Dipartimento di Fisica, Università di Milano-Bicocca, I-20126 Milano, Italy
2 shared publications - Filippo Vicentini
CPHT
2 shared publications - Rodolfo Carobene
Dipartimento di Fisica “Giuseppe Occhialini”, Università degli Studi di Milano-Bicocca, Milano, Italy
2 shared publications - David Linteau
École Polytechnique Fédérale de Lausanne (EPFL)
1 shared publication
Latest Publications
- 19 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Local fermion-to-qudit mappings: A practical recipe for four-level systems
- 19 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Local fermion-to-qudit mappings: A practical recipe for four-level systems
- Top Cited Papers
- 27 February 2025
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (2) , 025034
Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization
The simulation of molecular electronic structure is an important application of quantum devices. Recently, it has been shown that quantum devices can be effectively combined with classical supercomputing centers in the context of the sample-based quantum diagonalization (SQD) algorithm. This allowed the largest electronic structure quantum simulation to date (77 qubits) and opened near-term devices to practical use cases in chemistry toward the hundred-qubit mark. However, the description of many important physical and chemical properties of those systems, such as photo-absorption/-emission, requires a treatment that goes beyond the ground state alone. In this work, we extend the SQD algorithm to determine low-lying molecular excited states. The extended-SQD method improves over the original SQD method in accuracy, at the cost of an additional computational step. It also improves over quantum subspace expansion based on single and double electronic excitations, a widespread approach to excited states on pre-fault-tolerant quantum devices, in both accuracy and efficiency. We employ the extended SQD method to compute the first singlet (S 1) and triplet (T 1) excited states of the nitrogen molecule with a correlation-consistent basis set, and the ground- and excited-state properties of the [2Fe-2S] cluster.
- 27 February 2025
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (2) , 025034
Top Cited PapersQuantum-centric computation of molecular excited states with extended sample-based quantum diagonalization
The simulation of molecular electronic structure is an important application of quantum devices. Recently, it has been shown that quantum devices can be effectively combined with classical supercomputing centers in the context of the sample-based quantum diagonalization (SQD) algorithm. This allowed the largest electronic structure quantum simulation to date (77 qubits) and opened near-term devices to practical use cases in chemistry toward the hundred-qubit mark. However, the description of many important physical and chemical properties of those systems, such as photo-absorption/-emission, requires a treatment that goes beyond the ground state alone. In this work, we extend the SQD algorithm to determine low-lying molecular excited states. The extended-SQD method improves over the original SQD method in accuracy, at the cost of an additional computational step. It also improves over quantum subspace expansion based on single and double electronic excitations, a widespread approach to excited states on pre-fault-tolerant quantum devices, in both accuracy and efficiency. We employ the extended SQD method to compute the first singlet (S 1) and triplet (T 1) excited states of the nitrogen molecule with a correlation-consistent basis set, and the ground- and excited-state properties of the [2Fe-2S] cluster.
- Open Access
Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization
The simulation of molecular electronic structure is an important application of quantum devices. Recently, it has been shown that quantum devices can be effectively combined with classical supercomputing centers in the context of the sample-based quantum diagonalization (SQD) algorithm. This allowed the largest electronic structure quantum simulation to date (77 qubits) and opened near-term devices to practical use cases in chemistry toward the hundred-qubit mark. However, the description of many important physical and chemical properties of those systems, such as photo-absorption/-emission, requires a treatment that goes beyond the ground state alone. In this work, we extend the SQD algorithm to determine low-lying molecular excited states. The extended-SQD method improves over the original SQD method in accuracy, at the cost of an additional computational step. It also improves over quantum subspace expansion based on single and double electronic excitations, a widespread approach to excited states on pre-fault-tolerant quantum devices, in both accuracy and efficiency. We employ the extended SQD method to compute the first singlet (S$_1$) and triplet (T$_1$) excited states of the nitrogen molecule with a correlation-consistent basis set, and the ground- and excited-state properties of the [2Fe-2S] cluster.
Open AccessQuantum-centric computation of molecular excited states with extended sample-based quantum diagonalization
The simulation of molecular electronic structure is an important application of quantum devices. Recently, it has been shown that quantum devices can be effectively combined with classical supercomputing centers in the context of the sample-based quantum diagonalization (SQD) algorithm. This allowed the largest electronic structure quantum simulation to date (77 qubits) and opened near-term devices to practical use cases in chemistry toward the hundred-qubit mark. However, the description of many important physical and chemical properties of those systems, such as photo-absorption/-emission, requires a treatment that goes beyond the ground state alone. In this work, we extend the SQD algorithm to determine low-lying molecular excited states. The extended-SQD method improves over the original SQD method in accuracy, at the cost of an additional computational step. It also improves over quantum subspace expansion based on single and double electronic excitations, a widespread approach to excited states on pre-fault-tolerant quantum devices, in both accuracy and efficiency. We employ the extended SQD method to compute the first singlet (S$_1$) and triplet (T$_1$) excited states of the nitrogen molecule with a correlation-consistent basis set, and the ground- and excited-state properties of the [2Fe-2S] cluster.
- Open Access
- 6 May 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023130
Adaptive projected variational quantum dynamics
We propose an adaptive quantum algorithm to prepare accurate variational time evolved wave functions. The method is based on the projected variational quantum dynamics (pVQD) algorithm, that performs a global optimization with linear scaling in the number of variational parameters. Instead of fixing a variational ansatz at the beginning of the simulation, the circuit is grown systematically during the time evolution. Moreover, the adaptive step does not require auxiliary qubits and the gate search can be performed in parallel on different quantum devices. We apply the algorithm, named adaptive pVQD, to the simulation of driven spin models and fermionic systems, where it shows an advantage when compared to both Trotterized circuits and nonadaptive variational methods. Finally, we use the shallower circuits prepared using the adaptive pVQD algorithm to obtain more accurate measurements of physical properties of quantum systems on hardware. Published by the American Physical Society 2024
- 6 May 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023130
Open AccessAdaptive projected variational quantum dynamics
We propose an adaptive quantum algorithm to prepare accurate variational time evolved wave functions. The method is based on the projected variational quantum dynamics (pVQD) algorithm, that performs a global optimization with linear scaling in the number of variational parameters. Instead of fixing a variational ansatz at the beginning of the simulation, the circuit is grown systematically during the time evolution. Moreover, the adaptive step does not require auxiliary qubits and the gate search can be performed in parallel on different quantum devices. We apply the algorithm, named adaptive pVQD, to the simulation of driven spin models and fermionic systems, where it shows an advantage when compared to both Trotterized circuits and nonadaptive variational methods. Finally, we use the shallower circuits prepared using the adaptive pVQD algorithm to obtain more accurate measurements of physical properties of quantum systems on hardware. Published by the American Physical Society 2024
- Open Access
- 15 May 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 8 (3) , 035014
Sequence of penalties method to study excited states using VQE
We propose an extension of the variational quantum eigensolver (VQE) that leads to more accurate energy estimations and can be used to study excited states. The method is based on the introduction of a sequence of increasing penalties in the cost function. This approach does not require circuit modifications and thus can be applied with no additional depth cost. Through numerical simulations, we show that we are able to produce variational states with desired physical properties, such as total spin and charge. We assess its performance both on classical simulators and on currently available quantum devices, calculating the potential energy curves of small molecular systems in different physical configurations. Finally, we compare our method to the original VQE and to another extension, obtaining a better agreement with exact simulations for both energy and targeted physical quantities.
- 15 May 2023
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 8 (3) , 035014
Open AccessSequence of penalties method to study excited states using VQE
We propose an extension of the variational quantum eigensolver (VQE) that leads to more accurate energy estimations and can be used to study excited states. The method is based on the introduction of a sequence of increasing penalties in the cost function. This approach does not require circuit modifications and thus can be applied with no additional depth cost. Through numerical simulations, we show that we are able to produce variational states with desired physical properties, such as total spin and charge. We assess its performance both on classical simulators and on currently available quantum devices, calculating the potential energy curves of small molecular systems in different physical configurations. Finally, we compare our method to the original VQE and to another extension, obtaining a better agreement with exact simulations for both energy and targeted physical quantities.
- Open Access
Variational dynamics as a ground-state problem on a quantum computer
We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the Feynman-Kitaev Hamiltonian acting on the composed system as a qubit operator and find an approximate ground state using the Variational Quantum Eigensolver. We apply the algorithm to the study of the dynamics of a transverse field Ising chain with an increasing number of spins and time steps, proving a favorable scaling in terms of the number of two qubit gates. Through numerical experiments, we investigate its robustness against noise, showing that the method can be use to evaluate dynamical properties of quantum systems and detect the presence of dynamical quantum phase transitions by measuring Loschmidt echoes.
Open AccessVariational dynamics as a ground-state problem on a quantum computer
We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the Feynman-Kitaev Hamiltonian acting on the composed system as a qubit operator and find an approximate ground state using the Variational Quantum Eigensolver. We apply the algorithm to the study of the dynamics of a transverse field Ising chain with an increasing number of spins and time steps, proving a favorable scaling in terms of the number of two qubit gates. Through numerical experiments, we investigate its robustness against noise, showing that the method can be use to evaluate dynamical properties of quantum systems and detect the presence of dynamical quantum phase transitions by measuring Loschmidt echoes.
- Open Access
- 5 December 2022
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (4) , 043161
Variational dynamics as a ground-state problem on a quantum computer
We propose a variational quantum algorithm to study the real-time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the Feynman-Kitaev Hamiltonian acting on the composed system as a qubit operator and find an approximate ground state using the variational quantum eigensolver. We apply the algorithm to the study of the dynamics of a transverse-field Ising chain with an increasing number of spins and time steps, proving a favorable scaling in terms of the number of two-qubit gates. Through numerical experiments, we investigate its robustness against noise, showing that the method can be used to evaluate dynamical properties of quantum systems and detect the presence of dynamical quantum phase transitions by measuring Loschmidt echoes.
- 5 December 2022
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 4 (4) , 043161
Open AccessVariational dynamics as a ground-state problem on a quantum computer
We propose a variational quantum algorithm to study the real-time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the Feynman-Kitaev Hamiltonian acting on the composed system as a qubit operator and find an approximate ground state using the variational quantum eigensolver. We apply the algorithm to the study of the dynamics of a transverse-field Ising chain with an increasing number of spins and time steps, proving a favorable scaling in terms of the number of two-qubit gates. Through numerical experiments, we investigate its robustness against noise, showing that the method can be used to evaluate dynamical properties of quantum systems and detect the presence of dynamical quantum phase transitions by measuring Loschmidt echoes.
- 9 August 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 106 (2) , 022404
Quantum simulations of molecular systems with intrinsic atomic orbitals
Quantum simulations of molecular systems on quantum computers often employ minimal basis sets of Gaussian orbitals. In comparison with more realistic basis sets, quantum simulations employing minimal basis sets require fewer qubits and quantum gates but yield results of lower accuracy. A natural strategy to achieve more accurate results is to increase the basis set size, which, in turn, requires increasing the number of qubits and quantum gates. Here we explore the use of intrinsic atomic orbitals in quantum simulations of molecules to improve the accuracy of energies and properties at the same computational cost required by a minimal basis. We investigate ground-state energies and one- and two-body density operators in the framework of the variational quantum eigensolver employing and comparing different Ansätze. We also demonstrate the use of this approach in the calculation of ground- and excited-state energies of small molecules by a combination of quantum algorithms using IBM quantum computers.
- 9 August 2022
- Published by American Physical Society (APS) in Physical Review A
- Vol. 106 (2) , 022404
Quantum simulations of molecular systems with intrinsic atomic orbitals
Quantum simulations of molecular systems on quantum computers often employ minimal basis sets of Gaussian orbitals. In comparison with more realistic basis sets, quantum simulations employing minimal basis sets require fewer qubits and quantum gates but yield results of lower accuracy. A natural strategy to achieve more accurate results is to increase the basis set size, which, in turn, requires increasing the number of qubits and quantum gates. Here we explore the use of intrinsic atomic orbitals in quantum simulations of molecules to improve the accuracy of energies and properties at the same computational cost required by a minimal basis. We investigate ground-state energies and one- and two-body density operators in the framework of the variational quantum eigensolver employing and comparing different Ansätze. We also demonstrate the use of this approach in the calculation of ground- and excited-state energies of small molecules by a combination of quantum algorithms using IBM quantum computers.