Searcharxiv⌕ Search

arXiv subjects

Nahum Sá

Publications and source records attributed to Nahum Sá.

6 recordsLinked to original sources

Towards solving the BCS Hamiltonian gap in Near-Term Quantum Computers

In this work, using a NISQ framework, we obtain the gap of a BCS Hamiltonian. This could lead to interesting implications for superconductivity research. For such task, we choose to use the Variational Quantum Deflation and analyze the hardware restrictions that are needed to find the energy spectra on current quantum hardware. We also compare two different kinds of classical optimizers, Constrained Optimization BY Linear Approximations (COBYLA) and Simultaneous Perturbation Stochastic Approximation (SPSA), and study the effect of decoherence caused by the presence of noise when using simulations in real devices. We implement this method for a system with both 2 and 5 qubits. Furthermore, we show how to approximate the gap within one standard deviation, even with the presence of noise.

quant-ph↗

rustworkx: A High-Performance Graph Library for Python

In rustworkx, we provide a high-performance, flexible graph library for Python. rustworkx is inspired by NetworkX but addresses many performance concerns of the latter. rustworkx is written in Rust and is particularly suited for performance-sensitive applications that use graph representations.

cs.DS↗

PennyLane: Automatic differentiation of hybrid quantum-classical computations

PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices, supporting both qubit and continuous-variable paradigms. PennyLane's core feature is the ability to compute gradients of variational quantum circuits in a way that is compatible with classical techniques such as backpropagation. PennyLane thus extends the automatic differentiation algorithms common in optimization and machine learning to include quantum and hybrid computations. A plugin system makes the framework compatible with any gate-based quantum simulator or hardware. We provide plugins for hardware providers including the Xanadu Cloud, Amazon Braket, and IBM Quantum, allowing PennyLane optimizations to be run on publicly accessible quantum devices. On the classical front, PennyLane interfaces with accelerated machine learning libraries such as TensorFlow, PyTorch, JAX, and Autograd. PennyLane can be used for the optimization of variational quantum eigensolvers, quantum approximate optimization, quantum machine learning models, and many other applications.

quant-ph↗

Implementation of a two-stroke quantum heat engine with a collisional model

We put forth a quantum simulation of a stroboscopic two-stroke thermal engine in the IBMQ processor. The system consists of a quantum spin chain connected to two baths at their boundaries, prepared at different temperatures using the variational quantum thermalizer algorithm. The dynamics alternates between heat and work strokes, which can be separately designed using independent quantum circuits. The results show good agreement with theoretical predictions, showcasing IBMQ as a powerful tool to study thermodynamics in the quantum regime, as well as the implementation of variational quantum algorithms in real-world quantum computers. It also opens the possibility of simulating quantum heat transport across a broad range of chain geometries and interactions.

quant-ph↗

An Application of Quantum Annealing Computing to Seismic Inversion

Quantum computing, along with quantum metrology and quantum communication, are disruptive technologies that promise, in the near future, to impact different sectors of academic research and industry. Among the computational challenges with great interest in science and industry are the inversion problems. These kinds of numerical procedures can be described as the process of determining the cause of an event from measurements of its effects. In this paper, we apply a recursive quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. We compare the obtained results from the quantum computer to those derived from a classical algorithm. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.

quant-ph↗

$β$-Variational Autoencoder as an Entanglement Classifier

We focus on using an architecture similar to the $β$-Variational Autoencoder ($β$-VAE) to discriminate if a quantum state is entangled or separable based on measurements. We split the data into two sets, the set of local and correlated measurements. Using the latent space, which is a low dimensional representation of the data, we show that restricting ourselves to the set of local data it is not possible to distinguish between entangled and separable states. Meanwhile, when considering both correlated and local measurements, an accuracy of over 80% is attained in the structure of the latent space.

quant-ph↗