Variational quantum circuits (VQC) lie at the forefront of quantum machine learning research. Still, the use of quantum networks for real data processing remains challenging as the number of available qubits cannot accommodate a large dimensionality of data—if the usual angle encoding scenario is used. To achieve dimensionality reduction, Principal Component Analysis is routinely applied as a pre-processing method before the embedding of the classical features on qubits. In this work, we propose an alternative method which reduces the dimensionality of a given dataset by taking into account the specific quantum embedding that comes after. This method aspires to make quantum machine learning with VQCs more versatile and effective on datasets of high dimension. At a second step, we propose a quantum-inspired classical autoencoder model which can be used to encode information in low latent spaces. The power of our proposed models is exhibited via numerical tests. We show that our targeted dimensionality reduction method considerably boosts VQC’s performance, and we also identify cases for which the second model outperforms classical autoencoders in terms of reconstruction loss.
The geometric optimization of crystal structures is a procedure widely used in computational chemistry that changes the geometrical placement of the particles inside a structure. It is called structural relaxation and constitutes a local minimization problem with a non‐convex objective function whose domain complexity increases according to the number of particles involved. This work studies the performance of the two most popular gradient methods in structural relaxation, Steepest Descent and Conjugate Gradient. Although frequently employed, there is a lack of their study in this context from an algorithmic point of view. The algorithms are initially benchmarked on the basis of a constant step size. Three concepts for designing dynamic step size rules are then examined in detail and analyzed. Results show that there is a trade‐off between convergence rate and the possibility of an experiment to succeed. In order to address this, a function is proposed as a formal means for assigning utility to each method based on preference. The function is built according to a recently introduced model of preference indication concerning algorithms with deadline and their run time. It introduces the quantification of the optimization algorithms' performance according to convergence speed and success rate, thus enabling the appointment of a specific algorithmic recipe as the best choice for balanced preferences.
Post-quantum cryptography (PQC) is, and should be, currently dominating the field of cybersecurity, with many works designing and evaluating the transition of communications security to quantum-safe solutions. As the security level and implementations of post-quantum algorithms become more mature, the research on their application to realistic conditions changes accordingly, especially their application to widely adopted network architectures and corresponding protocols such as the Public Key Infrastructure (PKI). In this survey, we identified articles presenting ways of integrating PQC algorithms to PKI and classified related work according to the employed methods and benchmarking choices. The main results from many evaluations converge to similar conclusions on the performance of the most popular PC digital signature algorithms; however, modeling choices concerning architecture variants, hardware and measurement metrics vary. The diversity of the results and experimental setups makes comparison difficult and arrival at an objective conclusion regarding PKI requirements almost impossible. Ultimately, this review reveals a fragmented landscape of benchmarking practices for post-quantum PKI systems. The absence of standardized evaluation frameworks and common test environments limits the comparability and reproducibility of the findings. We aim to provide reference implementations, which are essential to guide the transition of PKI infrastructures toward robust, scalable, and quantum-resistant deployments.
The parity problem, a generalization of the XOR problem to higher-dimensional inputs, is a challenging benchmark for evaluating learning algorithms, due to its increased complexity as the number of dimensions of the feature space grows. In this work, a single-qubit classifier is developed, which can efficiently learn the parity function from input data. Despite the qubit model’s simplicity, the solution landscape created in the context of the parity problem offers an attractive test bed for exploring optimization methods for quantum classifiers. We propose a new optimization method called Ensemble Stochastic Gradient Descent (ESGD), with which density matrices describing batches of quantum states are incorporated into the loss function. We demonstrate that ESGD outperforms both Gradient Descent and Stochastic Gradient Descent given the aforementioned problem. Additionally, we show that applying ESGD with only one measurement per data input does not lead to any performance degradation. Our findings not only highlight the potential of a single-qubit model, but also offer valuable insights into the use of density matrices for optimization. Further to this, we complement the outcome with interesting results arising by the employment of a Doubly Stochastic Gradient Descent for training quantum variational circuits.
Crystal structures are important formations, bases of materials used in everyday life. A lot of effort is dedicated to the creation of new materials, starting from the study and combination of crystal structures' properties[1] through the crystals' geometric optimization. In the meantime, an equal amount of effort is dedicated to the study and development of methods employed in optimization problems; this, nevertheless, is carried out independently, in the context of computer science. There is a need, therefore, to acknowledge and highlight the overlap between the two fields, whilst creating a common language and establishing the theoretical foundations on which the optimization methods can become physically interpreted in the case of crystals. This article provides a detailed introduction to the theory behind the geometric optimization of crystals from the point of view of computer science, so as to facilitate interdisciplinary cooperation. Its target is to familiarize scientists from different fields with the problem, its parameters, and their derivations, in order to motivate their assistance in the creation, implementation, and application of new methods for the geometric optimization of crystal structures.
The parity problem, a generalization of the XOR problem to higher-dimensional inputs, is a challenging benchmark for evaluating learning algorithms, due to its increased complexity as the number of dimensions of the feature space grows. In this work, a single-qubit classifier is developed, which can efficiently learn the parity function from input data. Despite the qubit model’s simplicity, the solution landscape created in the context of the parity problem offers an attractive test bed for exploring optimization methods for quantum classifiers. We propose a new optimization method called Ensemble Stochastic Gradient Descent (ESGD), with which density matrices describing batches of quantum states are incorporated into the loss function. We demonstrate that ESGD outperforms both Gradient Descent and Stochastic Gradient Descent given the aforementioned problem. Additionally, we show that applying ESGD with only one measurement per data input does not lead to any performance degradation. Our findings not only highlight the potential of a single qubit model, but also offer valuable insights into the use of density matrices for optimization. Further to this, we complement the outcome with interesting results arising by the employment of a doubly stochastic gradient descent for training quantum variational circuits.