activity
20202026
most citedQuantum -nearest neighbors algorithm

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Random Quantum Circuits as Seeds for Continuous Generative Models

Olli Hirviniemi, Afrad Basheer, Thomas Cope

We introduce a random circuit family and show they are robust against current classical simulation techniques, specifically tensor network contraction and Pauli propagation. We als…

quant-ph2024

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

Afrad Basheer, Yuan Feng, Christopher Ferrie +2

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 loca…

quant-ph2023

Ansatz-Agnostic Exponential Resource Saving in Variational Quantum Algorithms Using Shallow Shadows

Afrad Basheer, Yuan Feng, Christopher Ferrie +1

Variational Quantum Algorithms (VQA) have been identified as a promising candidate for the demonstration of near-term quantum advantage in solving optimization tasks in chemical si…

quant-ph2022

Alternating Layered Variational Quantum Circuits Can Be Classically Optimized Efficiently Using Classical Shadows

Afrad Basheer, Yuan Feng, Christopher Ferrie +1

Variational quantum algorithms (VQAs) are the quantum analog of classical neural networks (NNs). A VQA consists of a parameterized quantum circuit (PQC) which is composed of multip…

quant-ph2020★ 2 cited

Quantum -nearest neighbors algorithm

Afrad Basheer, A. Afham, Sandeep K. Goyal

One of the simplest and most effective classical machine learning algorithms is the -nearest neighbors algorithm (NN) which classifies an unknown test state by finding the $k…