Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
About

About

I am Full Professor at the Department of Informatics at the University of Minho, and senior researcher at the High Assurance Software Laboratory (HASLab INESC TEC). Since October 2016, I am also serving as Deputy Head of UNU-EGOV, the United Nations University Operational Unit on Policy-driven Electronic Governance (egov.unu.edu).

My research interests are focused on program semantics and calculi applied to systems understanding and rigorous software construction. I am particularly interested in coalgebra theory and conductive reasoning, as well as on modal and hybrid logics.

In recent years I coordinated four research projects at the national level, bilateral partnerships with Brazil and China, and served as the Portuguese coordinator for the Language Engineering and Rigorous Software Development ALFA EU-Latin America network, a PhD training network funded by the European Union. I have published five book chapters, 25 journal papers and more than 60 international conference papers. Having served as invited lecturer in MSc and PhD programmes at the Universities of Bristol (United Kingdom), Tartu (Estonia), and Peking (China), I have supervised several PhD projects (six concluded; four on-going). One of my students, Alexandre Madeira, received the 2013 IBM Scientific Prize, the biggest award in Informatics in Portugal.

I integrated the founding team of the Joint Doctoral Programme in Computer Science of the Universities of Minho, Aveiro, and Porto (MAP-i), and served as its Director. I am a member of IFIP WG1.3 (Foundations of System Specification), and, since January 2019, chair of IFIP Tecnhical Committee TC1 on Foundations of Computer Science.

Currently, I am leading the Quantum Software Engineering Research Group at INL, the International Iberian Nanotechnology Laboratory.

Interest
Topics
Details

Details

  • Name

    Luís Soares Barbosa
  • Role

    Research Coordinator
  • Since

    01st November 2011
003
Publications

2024

On Quantum Natural Policy Gradients

Authors
Sequeira, A; Santos, LP; Barbosa, LS;

Publication
CoRR

Abstract

2024

Digital quantum simulation of non-perturbative dynamics of open systems with orthogonal polynomials

Authors
Guimaraes, JD; Vasilevskiy, MI; Barbosa, LS;

Publication
QUANTUM

Abstract
Classical non-perturbative simulations of open quantum systems' dynamics face several scalability problems, namely, exponential scaling of the computational effort as a function of either the time length of the simulation or the size of the open system. In this work, we propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer, which we term as Quantum TEDOPA (Q-TEDOPA), to simulate nonperturbative dynamics of open quantum systems linearly coupled to a bosonic environment (continuous phonon bath). By performing a change of basis of the Hamiltonian, the TEDOPA yields a chain of harmonic oscillators with only local nearestneighbour interactions, making this algorithm suitable for implementation on quantum devices with limited qubit connectivity such as superconducting quantum processors. We analyse in detail the implementation of the TEDOPA on a quantum device and show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work. We applied the proposed method to the simulation of the exciton transport between two light-harvesting molecules in the regime of moderate coupling strength to a non-Markovian harmonic oscillator environment on an IBMQ device. Applications of the Q-TEDOPA span problems which can not be solved by perturbation techniques belonging to different areas, such as the dynamics of quantum biological systems and strongly correlated condensed matter systems.

2024

Secure two-party computation via measurement-based quantum computing

Authors
Rahmani, Z; Pinto, AHMN; Barbosa, LMDCS;

Publication
QUANTUM INFORMATION PROCESSING

Abstract
Secure multiparty computation (SMC) provides collaboration among multiple parties, ensuring the confidentiality of their private information. However, classical SMC implementations encounter significant security and efficiency challenges. Resorting to the entangled Greenberger-Horne-Zeilinger (GHZ) state, we propose a quantum-based two-party protocol to compute binary Boolean functions, with the help of a third party. We exploit a technique in which a random Z-phase rotation on the GHZ state is performed to achieve higher security. The security and complexity analyses demonstrate the feasibility and improved security of our scheme compared to other SMC Boolean function computation methods. Additionally, we implemented the proposed protocol on the IBM QisKit and found consistent outcomes that validate the protocol's correctness.

2024

Quantum advantage in temporally flat measurement-based quantum computation

Authors
de Oliveira, M; Barbosa, LS; Galvao, EF;

Publication
QUANTUM

Abstract
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible simplifications in experimental demonstrations. In this paper we study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We propose new constructions for the deterministic computation of arbitrary Boolean functions, drawing on correlations present in multi-qubit Greenberger, Horne, and Zeilinger (GHZ) states. We characterize the necessary measurement complexity using the Clifford hierarchy, and also generally decrease the number of qubits needed with respect to previous constructions. In particular, we identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible, featuring quantum advantage in width and number of gates with respect to classical circuits.

2023

Paraconsistent Transition Systems

Authors
Cruz, A; Madeira, A; Barbosa, LS;

Publication
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE

Abstract
Often in Software Engineering a modelling formalism has to support scenarios of inconsistency in which several requirements either reinforce or contradict each other. Paraconsistent transition systems are proposed in this paper as one such formalism: states evolve through two accessibility relations capturing weighted evidence of a transition or its absence, respectively. Their weights come from a specific residuated lattice. A category of these systems, and the corresponding algebra, is defined providing a formal setting to model different application scenarios. One of them, dealing with the effect of quantum decoherence in quantum programs, is used for illustration purposes.

Supervised
thesis

2023

Timing Constraints in Quantum Programming Languages

Author
Vítor Emanuel Gonçalves Fernandes

Institution
UM

2023

Time-structure in measurement-based quantum computation

Author
Michael de Oliveira

Institution
UM

2023

Continuous-time Quantum Walks

Author
Jaime Pereira Santos

Institution
UM

2022

Continuous-time Quantum Walks

Author
Jaime Pereira Santos

Institution
UM

2022

Quantum Reinforcement Learning: Foundations, algorithms, applications

Author
André Manuel Resende Sequeira

Institution
UM