Search Results for author: J. Biamonte

Found 5 papers, 0 papers with code

On Circuit Depth Scaling For Quantum Approximate Optimization

no code implementations3 May 2022 V. Akshay, H. Philathong, E. Campos, D. Rabinovich, I. Zacharov, Xiao-Ming Zhang, J. Biamonte

Focusing on random instances of MAX-2-SAT, we test our predictive model against simulated data with up to 15 qubits.

Combinatorial Optimization

Training Saturation in Layerwise Quantum Approximate Optimisation

no code implementations25 Jun 2021 E. Campos, D. Rabinovich, V. Akshay, J. Biamonte

Doing so we discovered that such training always saturates -- called \textit{training saturation} -- at some depth $p^*$, meaning that past a certain depth, overlap can not be improved by adding subsequent layers.

Probing Criticality in Quantum Spin Chains with Neural Networks

no code implementations5 May 2020 A Berezutskii, M Beketov, D Yudin, Z Zimborás, J. Biamonte

The numerical emulation of quantum systems often requires an exponential number of degrees of freedom which translates to a computational bottleneck.

Dimensionality Reduction

Reachability Deficits in Quantum Approximate Optimization

no code implementations26 Jun 2019 V. Akshay, H. Philathong, M. E. S. Morales, J. Biamonte

The quantum approximate optimization algorithm (QAOA) has rapidly become a cornerstone of contemporary quantum algorithm development.

Computational Phase Transition Signature in Gibbs Sampling

no code implementations25 Jun 2019 H. Philathong, V. Akshay, I. Zacharov, J. Biamonte

This so called, algorithmic or computational phase transition signature, has yet-to-be observed in contemporary physics based processors.

Cannot find the paper you are looking for? You can Submit a new open access paper.