The Ising model, a cornerstone in the understanding of critical points, phase transitions, and magnetic systems, has been pivotal in advancing our knowledge of statistical physics. Although analytical solutions exist for the 1D and 2D Ising models, complexities rise significantly with the inclusion of external magnetic fields and in higher dimensions. Here, we demonstrate a novel quantum computational approach to simulate the 1D Ising model with basic quantum gates in the QISKIT(Python) that is both accessible to beginners and executable on personal computers, bypassing the need for advanced computational infrastructure. By initializing the system in a comprehensive superposition state, we effectively utilize quantum gates to replicate the intricate interactions between spins and external fields. This method offers a more intuitive and direct observational means of the system's evolution, distinguishing it from previous methodologies. Our results not only repeat all the physics behavior in the 1D Ising model but also showcase the expanding capabilities of quantum computing to tackle complex physical systems, promising advancements in both theoretical and applied physics.

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

In this article, we investigate the applicability of quantum machine learning for classification tasks using two quantum classifiers from the Qiskit Python environment: the Variational Quantum Classifier (VQC) and the Quantum Kernel Estimator (QKE). We evaluate the performance of these classifiers on six widely known and publicly available benchmark datasets and analyze how their performance varies with the number of samples on two artificially generated test classification datasets. As quantum machine learning is based on unitary transformations, this paper explores data structures and application fields that could be particularly suitable for quantum advantages. Hereby, we developed a data set based on concepts from quantum mechanics using the exponential map of a Lie algebra. This dataset will be made publicly available and contributes a novel contribution to the empirical evaluation of quantum supremacy. We further compared the performance of VQC and QKE on six widely applicable datasets to contextualize our results.\\ Our results demonstrate that the VQC and QKE perform better than basic machine learning algorithms such as advanced linear regression models (Ridge and Lasso). They do not match the accuracy and runtime performance of sophisticated modern boosting classifiers like XGBoost, LightGBM, or CatBoost. Therefore, we conclude that while quantum machine learning algorithms have the potential to surpass classical machine learning methods in the future, especially when physical quantum infrastructure becomes widely available, they currently lag behind classical approaches. Our investigations also show that classical machine learning approaches have superior performance classifying datasets based on group structures, compared to quantum approaches that particularly use unitary processes.\\ Furthermore, our findings highlight the significant impact of different quantum simulators, feature maps, and quantum circuits on the performance of the employed quantum estimators. This observation emphasizes the need for researchers to provide detailed explanations of their hyperparameter choices for quantum machine learning algorithms, as this aspect is currently overlooked in many studies within the field.\\ To facilitate further research in this area and ensure the transparency of our study, we have made the complete code available in a linked GitHub repository.