CFChristopher Ferrie

Christopher Ferrie

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Christopher Ferrie has a total of 73 co-authors. Here are the top co-authors by number of shared publications:

  • Christopher Granade

    School of Physics, University of Sydney, Sydney, NSW, Australia

    8 shared publications
  • Joshua Combes

    The University of Melbourne

    7 shared publications
  • Joseph Emerson

    Institute for Quantum Computing and Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada

    6 shared publications
  • Carlton M. Caves

    Center for Quantum Information and Control, University of New Mexico, Albuquerque, NM 87131, USA

    5 shared publications
  • Nathan Wiebe

    Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052, USA and Department of Combinatorics & Optimization, University of Waterloo, Ontario N2L 3G1, Canada and Institute for Quantum Computing, University of Waterloo, Ontario N2L 3G1, Canada

    5 shared publications
  • Robin Blume-Kohout

    Center for Computing Research (Sandia National Laboratories), Albuquerque, New Mexico 87185, USA

    5 shared publications

Latest Publications

  • Open Access

    Local surrogates for quantum machine learning

    by Sreeraj Rajindran Nair, Christopher Ferrie

    Surrogates have been proposed as classical simulations of the pretrained quantum learning models, which are capable of mimicking the input-output relation inherent in the quantum model. Quantum hardware within this framework is used for training and for generating the classical surrogates. Inference is relegated to the classical surrogate, hence alleviating the extra quantum computational cost once training is done. Taking inspiration from interpretable models, we introduce a local surrogation protocol based on reuploading-type quantum learning models, including local quantum surrogates as cost-efficient intermediate quantum learning models. When the training and inference are only concerned with a subregion of the data space, deploying a local quantum surrogate offers qubit cost reductions and the downstream local classical surrogate achieves dequantization of the inference phase. Several numerical experiments are presented.

  • Open Access

    Local surrogates for quantum machine learning

    by Sreeraj Rajindran Nair, Christopher Ferrie

    Surrogates have been proposed as classical simulations of the pretrained quantum learning models, which are capable of mimicking the input-output relation inherent in the quantum model. Quantum hardware within this framework is used for training and for generating the classical surrogates. Inference is relegated to the classical surrogate, hence alleviating the extra quantum computational cost once training is done. Taking inspiration from interpretable models, we introduce a local surrogation protocol based on reuploading-type quantum learning models, including local quantum surrogates as cost-efficient intermediate quantum learning models. When the training and inference are only concerned with a subregion of the data space, deploying a local quantum surrogate offers qubit cost reductions and the downstream local classical surrogate achieves dequantization of the inference phase. Several numerical experiments are presented.

  • Open Access

    Short-time quantum Fourier transform processing

    by Sreeraj Rajindran Nair, Benjamin Southwell, Christopher Ferrie

    Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based processing schemes. Whilst quantum analogs to some digital signal processing algorithms have been discovered, including the quantum Fourier transform (QFT), there has been no development of short-time processing techniques in the quantum domain. In this manuscript, we introduce the short-time QFT (STQFT) processing technique to bridge this gap in research. We develop a novel overlap-add reconstruction technique in the quantum domain using a permutation gate to combine subsequent windows. With this in mind, we discuss convolution under our novel STQFT processing scheme. We demonstrate filtering in the quantum Fourier domain with a filter stored in a quantum register as well as in a block encoded unitary gate. Throughout the paper, we elaborate upon implementation details such as applying DC offsets to input signals, skipping input data frames whenever necessary, the use of overlap-save as a reconstruction technique and mitigating time-varying scaling due to normalization of the windowed input data and filters.

  • Open Access

    On the Trainability and Classical Simulability of Learning Matrix Product States Variationally

    by Afrad Basheer, Yuan Feng, Christopher Ferrie, Sanjiang Li, Hakop Pashayan

    We prove that using global observables to train the matrix product state ansatz results in the vanishing of all partial derivatives, also known as barren plateaus, while using local observables avoids this. This ansatz is widely used in quantum machine learning for learning weakly entangled state approximations. Additionally, we empirically demonstrate that in many cases, the objective function is an inner product of almost sparse operators, highlighting the potential for classically simulating such a learning problem with few quantum resources. All our results are experimentally validated across various scenarios.


  • Open Access

    A quantum approach to synthetic minority oversampling technique (SMOTE)

    by Nishikanta Mohanty, Bikash K. Behera, Christopher Ferrie, Pravat Dash

    The paper proposes the Quantum-SMOTE method, a novel solution that uses quantum computing techniques to solve the prevalent problem of class imbalance in machine learning datasets. Quantum-SMOTE, inspired by the Synthetic Minority Oversampling Technique (SMOTE), generates synthetic data points using quantum processes such as swap tests and quantum rotation. The process varies from the conventional SMOTE algorithm’s usage of K-Nearest Neighbors (KNN) and Euclidean distances, enabling synthetic instances to be generated from minority class data points without relying on neighbor proximity. The algorithm asserts greater control over the synthetic data generation process by introducing hyperparameters such as rotation angle, minority percentage, and splitting factor, which allow for customization to specific dataset requirements. Due to the use of a compact swap test, the algorithm can accommodate a large number of features. Furthermore, the approach is tested on a public dataset of TelecomChurn and evaluated alongside two prominent classification algorithms, Random Forest and Logistic Regression, to determine its impact along with varying proportions of synthetic data.


  • Open Access

    Quantum SMOTE with Angular Outliers: Redefining Minority Class Handling

    by Nishikanta Mohanty, Bikash K. Behera, Christopher Ferrie

    This paper introduces Quantum-SMOTEV2, an advanced variant of the Quantum-SMOTE method, leveraging quantum computing to address class imbalance in machine learning datasets without K-Means clustering. Quantum-SMOTEV2 synthesizes data samples using swap tests and quantum rotation centered around a single data centroid, concentrating on the angular distribution of minority data points and the concept of angular outliers (AOL). Experimental results show significant enhancements in model performance metrics at moderate SMOTE levels (30-36%), which previously required up to 50% with the original method. Quantum-SMOTEV2 maintains essential features of its predecessor (arXiv:2402.17398), such as rotation angle, minority percentage, and splitting factor, allowing for tailored adaptation to specific dataset needs. The method is scalable, utilizing compact swap tests and low depth quantum circuits to accommodate a large number of features. Evaluation on the public Cell-to-Cell Telecom dataset with Random Forest (RF), K-Nearest Neighbours (KNN) Classifier, and Neural Network (NN) illustrates that integrating Angular Outliers modestly boosts classification metrics like accuracy, F1 Score, AUC-ROC, and AUC-PR across different proportions of synthetic data, highlighting the effectiveness of Quantum-SMOTEV2 in enhancing model performance for edge cases.

  • Open Access

    CoLA-Former: Graph Transformer Using Communal Linear Attention for Lightweight Sequential Recommendation

    by Afrad Basheer, Yuan Feng, Christopher Ferrie, Sanjiang Li

    Graph Transformer has shown great promise in capturing the dynamics of user preferences for sequential recommendations. However, the self-attention mechanism within its structure is of quadratic complexity, posing challenges for deployment on devices with limited resources. To this end, we propose a Communal Linear Attention-enhanced Graph TransFormer for lightweight sequential recommendation, namely CoLA-Former. Specifically, we introduce a Communal Linear Attention (CoLAttention) mechanism. It utilizes low-rank yet reusable communal units to calculate the global correlations on sequential graphs. The weights from the units are also made communal across different training batches, enabling inter-batch global weighting. Moreover, we devise a low-rank approximation component. It utilizes weights distillation to reduce the scale of the trainable parameters in the Graph Transformer network. Extensive experimental results on three real-world datasets demonstrate that the proposed CoLA-Former significantly outperforms twelve state-of-the-art methods in accuracy and efficiency. The datasets and codes are available at https://github.com/ZZY-GraphMiningLab/CoLA_Former.


  • Open Access

    Solving the vehicle routing problem via quantum support vector machines

    by Nishikanta Mohanty, Bikash K. Behera, Christopher Ferrie

    The vehicle routing problem (VRP) is an example of a combinatorial optimization problem that has attracted academic attention due to its potential use in various contexts. VRP aims to arrange vehicle deliveries to several sites in the most efficient and economical manner possible. Quantum machine learning offers a new way to obtain solutions by harnessing the natural speedups of quantum effects, although many solutions and methodologies are modified using classical tools to provide excellent approximations of the VRP. In this paper, we employ 6 and 12 qubit circuits, respectively, to build and evaluate a hybrid quantum machine learning approach for solving VRP of 3- and 4-city scenarios. The approach employs quantum support vector machines (QSVMs) trained using a variational quantum eigensolver on a static or dynamic ansatz. Different encoding strategies are used in the experiment to transform the VRP formulation into a QSVM and solve it. Multiple optimizers from the IBM Qiskit framework are also evaluated and compared


  • Open Access

    Quantum optimization for training quantum neural networks

    by Yidong Liao, Min-Hsiu Hsieh, Chris Ferrie

    Training quantum neural networks (QNNs) using gradient-based or gradient-free classical optimization approaches is severely impacted by the presence of barren plateaus in the cost landscapes. In this paper, we devise a framework for leveraging quantum optimization algorithms to find optimal parameters of QNNs for certain tasks. To cast the optimization problem of training QNN into the context of quantum optimization, the parameters in QNN are quantized—moved from being classical to being stored in quantum registers which are in addition to those upon which the QNN is performing its computation. We then coherently encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the QNN parameters. The parameters are tuned with an iterative quantum optimization structure using adaptively selected Hamiltonians. The quantum mechanism of this framework exploits hidden structure in the QNN optimization problem and hence is expected to provide beyond-Grover speed up, mitigating the barren plateau issue.


  • Open Access

    Analysis of the Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in the Presence of Noisy Channels

    by Nishikanta Mohanty, Bikash K. Behera, Christopher Ferrie

    The vehicle routing problem (VRP) is an NP-hard optimization problem that has been an interest of research for decades in science and industry. The objective is to plan routes of vehicles to deliver goods to a fixed number of customers with optimal efficiency. Classical tools and methods provide good approximations to reach the optimal global solution. Quantum computing and quantum machine learning provide a new approach to solving combinatorial optimization of problems faster due to inherent speedups of quantum effects. Many solutions of VRP are offered across different quantum computing platforms using hybrid algorithms such as quantum approximate optimization algorithm and quadratic unconstrained binary optimization. In this work, we build a basic VRP solver for 3 and 4 cities using the variational quantum eigensolver on a fixed ansatz. The work is further extended to evaluate the robustness of the solution in several examples of noisy quantum channels. We find that the performance of the quantum algorithm depends heavily on what noise model is used. In general, noise is detrimental, but not equally so among different noise sources.