Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
10 result(s) for "Tibaldi, Simone"
Sort by:
Three-Phase Confusion Learning
The use of Neural Networks in quantum many-body theory has undergone a formidable rise in recent years. Among the many possible applications, their pattern recognition power can be utilized when dealing with the study of equilibrium phase diagrams. Learning by Confusion has emerged as an interesting and unbiased scheme within this context. This technique involves systematically reassigning labels to the data in various ways, followed by training and testing the Neural Network. While random labeling results in low accuracy, the method reveals a peak in accuracy when the data are correctly and meaningfully partitioned, even if the correct labeling is initially unknown. Here, we propose a generalization of this confusion scheme for systems with more than two phases, for which it was originally proposed. Our construction relies on the use of a slightly different Neural Network: from a binary classifier, we move to a ternary one, which is more suitable to detect systems exhibiting three phases. After introducing this construction, we test it on free and interacting Kitaev chains and on the one-dimensional Extended Hubbard model, consistently achieving results that are compatible with previous works. Our work opens the way to wider use of Learning by Confusion, demonstrating once more the usefulness of Machine Learning to address quantum many-body problems.
3-phases Confusion Learning
The use of Neural Networks in quantum many-body theory has seen a formidable rise in recent years. Among the many possible applications, one surely is to make use of their pattern recognition power when dealing with the study of equilibrium phase diagram. Within this context, Learning by Confusion has emerged as an interesting, unbiased scheme. The idea behind it briefly consists in iteratively label numerical results in a random way and then train and test a Neural Network; while for a generic random labeling the Network displays low accuracy, the latter shall display a peak when data are divided into a correct, yet unknown way. Here, we propose a generalization of this confusion scheme for systems with more than two phases, for which it was originally proposed. Our construction simply relies on the use of a slightly different Neural Network: from a binary classificator we move to a ternary one, more suitable to detect systems exhibiting three phases. After introducing this construction, we test is onto the free and the interacting Kitaev chain and on the one-dimensional Extended Hubbard model, always finding results compatible with previous works. Our work opens the way to wider use of Learning by Confusion, showing once more the usefulness of Machine Learning to address quantum many-body problems.
Analog QAOA with Bayesian optimisation on a neutral atom QPU
This study explores the implementation of the Quantum Approximate Optimisation Algorithm (QAOA) in its analog form using a neutral atom quantum processing unit to solve the Maximum Independent Set problem. Our QAOA protocol leverages the natural encoding of problem Hamiltonians by Rydberg atom interactions, while employing Bayesian Optimisation to navigate the quantum-classical parameter space effectively under the constraints of hardware noise and resource limitations. We evaluate the approach through a combination of numerical simulations and experimental runs on Pasqal’s first commercial quantum processing unit, Orion Alpha, demonstrating effective parameter optimisation and noise mitigation strategies, such as selective bitstring discarding and detection error corrections. Results show that a limited number of measurements still allows for a quick convergence to a solution, making it a viable solution for resource-efficient scenarios.
Unsupervised and supervised learning of interacting topological phases from single-particle correlation functions
The recent advances in machine learning algorithms have boosted the application of these techniques to the field of condensed matter physics, in order e.g. to classify the phases of matter at equilibrium or to predict the real-time dynamics of a large class of physical models. Typically in these works, a machine learning algorithm is trained and tested on data coming from the same physical model. Here we demonstrate that unsupervised and supervised machine learning techniques are able to predict phases of a non-exactly solvable model when trained on data of a solvable model. In particular, we employ a training set made by single-particle correlation functions of a non-interacting quantum wire and by using principal component analysis, k-means clustering, and convolutional neural networks we reconstruct the phase diagram of an interacting superconductor. We show that both the principal component analysis and the convolutional neural networks trained on the data of the non-interacting model can identify the topological phases of the interacting model with a high degree of accuracy. Our findings indicate that non-trivial phases of matter emerging from the presence of interactions can be identified by means of unsupervised and supervised techniques applied to data of non-interacting systems.
3-phases Confusion Learning
The use of Neural Networks in quantum many-body theory has seen a formidable rise in recent years. Among the many possible applications, one surely is to make use of their pattern recognition power when dealing with the study of equilibrium phase diagram. Within this context, Learning by Confusion has emerged as an interesting, unbiased scheme. The idea behind it briefly consists in iteratively label numerical results in a random way and then train and test a Neural Network; while for a generic random labeling the Network displays low accuracy, the latter shall display a peak when data are divided into a correct, yet unknown way. Here, we propose a generalization of this confusion scheme for systems with more than two phases, for which it was originally proposed. Our construction simply relies on the use of a slightly different Neural Network: from a binary classificator we move to a ternary one, more suitable to detect systems exhibiting three phases. After introducing this construction, we test is onto the free and the interacting Kitaev chain and on the one-dimensional Extended Hubbard model, always finding results compatible with previous works. Our work opens the way to wider use of Learning by Confusion, showing once more the usefulness of Machine Learning to address quantum many-body problems.
Analog QAOA with Bayesian Optimisation on a neutral atom QPU
This study explores the implementation of the Quantum Approximate Optimisation Algorithm (QAOA) in its analog form using a neutral atom quantum processing unit to solve the Maximum Independent Set problem. The analog QAOA leverages the natural encoding of problem Hamiltonians by Rydberg atom interactions, while employing Bayesian Optimisation to navigate the quantum-classical parameter space effectively under the constraints of hardware noise and resource limitations. We evaluate the approach through a combination of simulations and experimental runs on Pasqal's first commercial quantum processing unit, Orion Alpha, demonstrating effective parameter optimisation and noise mitigation strategies, such as selective bitstring discarding and detection error corrections. Results show that a limited number of measurements still allows for a quick convergence to a solution, making it a viable solution for resource-efficient scenarios.
Quantum Circuit for Imputation of Missing Data
The imputation of missing data is a common procedure in data analysis that consists in predicting missing values of incomplete data points. In this work we analyse a variational quantum circuit for the imputation of missing data. We construct variational quantum circuits with gates complexity \\(O(N)\\) and \\(O(N^2)\\) that return the last missing bit of a binary string for a specific distribution. We train and test the performance of the algorithms on a series of datasets finding good convergence of the results. Finally, we test the circuit for generalization to unseen data. For simple systems, we are able to describe the circuit analytically, making possible to skip the tedious and unresolved problem of training the circuit with repetitive measurements. We find beforehand the optimal values of the parameters and we make use of them to construct an optimal circuit suited to the generation of truly random data.
Bayesian Optimization for QAOA
The Quantum Approximate Optimization Algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems. In fact, it relies on a classical subroutine to optimize the parameters of a quantum circuit. In this work we present a Bayesian optimization procedure to fulfil this optimization task, and we investigate its performance in comparison with other global optimizers. We show that our approach allows for a significant reduction in the number of calls to the quantum circuit, which is typically the most expensive part of the QAOA. We demonstrate that our method works well also in the regime of slow circuit repetition rates, and that few measurements of the quantum ansatz would already suffice to achieve a good estimate of the energy. In addition, we study the performance of our method in the presence of noise at gate level, and we find that for low circuit depths it is robust against noise. Our results suggest that the method proposed here is a promising framework to leverage the hybrid nature of QAOA on the noisy intermediate-scale quantum devices.
Skin Pigmentation in Gilthead Seabream (Sparus aurata L.) Fed Conventional and Novel Protein Sources in Diets Deprived of Fish Meal
The pattern of yellowish pigmentation of the skin was assessed in gilthead seabream (Sparus aurata) fed for 12 weeks iso-proteic (45%) and iso-lipidic (20%) diets deprived of fish meal and containing either a blend of vegetable protein-rich ingredients or where graded levels of the vegetable protein blend were replaced by insect (Hermetia illucens—10%, 20% or 40%) pupae meal, poultry by-product meal (20%, 30% or 40%), red swamp crayfish meal (10%) and marine microalgae (Tisochrysis lutea and Tetraselmis suecica—10%) dried biomass. Digital images of fish fed diets differing in protein sources were analyzed by means of an automatic and non-invasive image analysis tool, in order to determine the number of yellow pixels and their dispersion on the frontal and lateral sides of the fish. The relationship between the total carotenoid concentration in the diet and the number of yellow pixels was investigated. Test diets differently affected gilthead seabream skin pigmentation both in the forefront and the operculum, due to their carotenoid content. The highest yellow pixels’ number was observed with the diet containing microalgae. Fish fed poultry by-product meal were characterized by the lowest yellow pixels’ number, diets containing insect meal had an intermediate coloring capacity. The vegetable control, the microalgae mix diet and the crayfish diet had significantly higher values of yellow pixels at both inspected skin sites.