Andrew Vlasic
Andrew Vlasic has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Anh Pham
Deloitte Consulting LLP
2 shared publications- Arthur J. Parzygnat
Experimental Study Group Massachusetts Institute of Technology 02139 Cambridge Massachusetts USA
1 shared publication - Tai-Danae Bradley
Sandbox@Alphabet, Mountain View, CA 94043, USA
1 shared publication
Latest Publications
- Open Access
- 8 December 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Toward structure-preserving quantum encodings
Harnessing the potential computational advantage of quantum computers for machine learning tasks relies on the uploading of classical data onto quantum computers through what are commonly referred to as quantum encodings. The choice of such encodings may vary substantially from one task to another, and there exist only a few cases where structure has provided insight into their design and implementation, such as symmetry in geometric quantum learning. Here, we propose the perspective that category theory offers a natural mathematical framework for analyzing encodings that respect structure inherent in datasets and learning tasks. We illustrate this with pedagogical examples, which include geometric quantum machine learning, quantum metric learning, topological data analysis, and more. Moreover, such a perspective provides a language in which to ask meaningful and mathematically precise questions for the design of quantum encodings and circuits for quantum machine learning tasks.
- 8 December 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Open AccessToward structure-preserving quantum encodings
Harnessing the potential computational advantage of quantum computers for machine learning tasks relies on the uploading of classical data onto quantum computers through what are commonly referred to as quantum encodings. The choice of such encodings may vary substantially from one task to another, and there exist only a few cases where structure has provided insight into their design and implementation, such as symmetry in geometric quantum learning. Here, we propose the perspective that category theory offers a natural mathematical framework for analyzing encodings that respect structure inherent in datasets and learning tasks. We illustrate this with pedagogical examples, which include geometric quantum machine learning, quantum metric learning, topological data analysis, and more. Moreover, such a perspective provides a language in which to ask meaningful and mathematically precise questions for the design of quantum encodings and circuits for quantum machine learning tasks.
- Open Access
- 5 April 2025
- Published by Qeios Ltd
Review of: "Hybrid Quantum Neural Networks with Amplitude Encoding: Advancing Recovery Rate Predictions"
Chen et al. propose a hybrid quantum-classical neural network to learn a regression model on recovery rate predictions. While the authors argue the use of a hybrid architecture, they do not fully explain precisely (either in the manuscript or GitHub...
- 5 April 2025
- Published by Qeios Ltd
Open AccessReview of: "Hybrid Quantum Neural Networks with Amplitude Encoding: Advancing Recovery Rate Predictions"
Chen et al. propose a hybrid quantum-classical neural network to learn a regression model on recovery rate predictions. While the authors argue the use of a hybrid architecture, they do not fully explain precisely (either in the manuscript or GitHub...
- 16 February 2025
- Published by Wiley in Annalen der Physik
- Vol. 537 (5)
Scoring Anomalous Vertices Through Quantum Walks
With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi‐labeled data, and data with no labels known a priori. For data with at best quasi‐labels, graphs are a natural representation and have important applications in many industries and scientific disciplines. Specifically, for unlabeled data, anomaly detection on graphs is a method to determine which data points do not posses the latent characteristics that are present in most other data. There have been a variety of classical methods to compute an anomalous score for the individual vertices of a respective graph, such as checking the local topology of a node, random walks, and complex neural networks. Leveraging the structure of the graph, the first quantum algorithm is proposed to calculate the anomaly score of each node by continuously traversing the graph with a uniform starting position for all nodes. The proposed algorithm incorporates well‐known characteristics of quantum walks, and, taking into consideration the noisy intermediate‐scale quantum (NISQ) era and subsequent intermediate‐scale quantum (ISQ) era, an adjustment to the algorithm is provided to mitigate the increasing depth of the circuit. This algorithm is rigorously shown to converge to the expected probability with respect to the initial condition.
- 16 February 2025
- Published by Wiley in Annalen der Physik
- Vol. 537 (5)
Scoring Anomalous Vertices Through Quantum Walks
With the constant flow of data from vast sources over the past decades, a plethora of advanced analytical techniques have been developed to extract relevant information from different data types ranging from labeled data, quasi‐labeled data, and data with no labels known a priori. For data with at best quasi‐labels, graphs are a natural representation and have important applications in many industries and scientific disciplines. Specifically, for unlabeled data, anomaly detection on graphs is a method to determine which data points do not posses the latent characteristics that are present in most other data. There have been a variety of classical methods to compute an anomalous score for the individual vertices of a respective graph, such as checking the local topology of a node, random walks, and complex neural networks. Leveraging the structure of the graph, the first quantum algorithm is proposed to calculate the anomaly score of each node by continuously traversing the graph with a uniform starting position for all nodes. The proposed algorithm incorporates well‐known characteristics of quantum walks, and, taking into consideration the noisy intermediate‐scale quantum (NISQ) era and subsequent intermediate‐scale quantum (ISQ) era, an adjustment to the algorithm is provided to mitigate the increasing depth of the circuit. This algorithm is rigorously shown to converge to the expected probability with respect to the initial condition.
- Open Access
- 4 February 2021
- Published by World Scientific Pub Co Pte Ltd in International Game Theory Review
- Vol. 23 (03) , 2150001
Markovian Switching of Mutation Rates in Evolutionary Network Dynamics
The replicator–mutator dynamic was originally derived to model the evolution of language, and since the model was derived in such a general manner, it has been applied to the dynamics of social behavior and decision making in multi-agent networks. For the two type population, a bifurcation point of the mutation rate was derived, displaying different long-run behaviors above and below this point. The long-run behavior would naturally be subjected to noise from the environment, however, to date, there does not exist a model that dynamically accounts for the effects of the environment. To account for the environmental impacts on the evolution of the populace, mutation rates above and below this bifurcation point are switched according to a continuous-time Markov chain. The long-run behaviors of this model are derived, showing a counterintuitive result that the majority of initial conditions will favor the dominated type.
- 4 February 2021
- Published by World Scientific Pub Co Pte Ltd in International Game Theory Review
- Vol. 23 (03) , 2150001
Open AccessMarkovian Switching of Mutation Rates in Evolutionary Network Dynamics
The replicator–mutator dynamic was originally derived to model the evolution of language, and since the model was derived in such a general manner, it has been applied to the dynamics of social behavior and decision making in multi-agent networks. For the two type population, a bifurcation point of the mutation rate was derived, displaying different long-run behaviors above and below this point. The long-run behavior would naturally be subjected to noise from the environment, however, to date, there does not exist a model that dynamically accounts for the effects of the environment. To account for the environmental impacts on the evolution of the populace, mutation rates above and below this bifurcation point are switched according to a continuous-time Markov chain. The long-run behaviors of this model are derived, showing a counterintuitive result that the majority of initial conditions will favor the dominated type.