Logical quantum processor based on reconfigurable atom arrays
Suppressing errors is the central challenge for useful quantum computing, requiring
quantum error correction (QEC),,,–for large-scale processing. However, the overhead in the …
quantum error correction (QEC),,,–for large-scale processing. However, the overhead in the …
NISQ computers: a path to quantum supremacy
M AbuGhanem, H Eleuch - IEEE Access, 2024 - ieeexplore.ieee.org
The quest for quantum advantage, wherein quantum computers surpass the computational
capabilities of classical computers executing state-of-the-art algorithms on well-defined …
capabilities of classical computers executing state-of-the-art algorithms on well-defined …
Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
A recent quantum simulation of observables of the kicked Ising model on 127 qubits
implemented circuits that exceed the capabilities of exact classical simulation. We show that …
implemented circuits that exceed the capabilities of exact classical simulation. We show that …
Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
Today's experimental noisy quantum processors can compete with and surpass all known
algorithms on state-of-the-art supercomputers for the computational benchmark task of …
algorithms on state-of-the-art supercomputers for the computational benchmark task of …
Benchmarking highly entangled states on a 60-atom analogue quantum simulator
Quantum systems have entered a competitive regime in which classical computers must
make approximations to represent highly entangled quantum states,. However, in this …
make approximations to represent highly entangled quantum states,. However, in this …
Random unitaries in extremely low depth
We prove that random quantum circuits on any geometry, including a 1D line, can form
approximate unitary designs over $ n $ qubits in $\log n $ depth. In a similar manner, we …
approximate unitary designs over $ n $ qubits in $\log n $ depth. In a similar manner, we …
Nishimori transition across the error threshold for constant-depth quantum circuits
Quantum computing involves the preparation of entangled states across many qubits. This
requires efficient preparation protocols that are stable to noise and gate imperfections. Here …
requires efficient preparation protocols that are stable to noise and gate imperfections. Here …
Information processing at the speed of light
M AbuGhanem - Frontiers of Optoelectronics, 2024 - Springer
In recent years, quantum computing has made significant strides, particularly in light-based
technology. The introduction of quantum photonic chips has ushered in an era marked by …
technology. The introduction of quantum photonic chips has ushered in an era marked by …
Classical algorithm for simulating experimental Gaussian boson sampling
Gaussian boson sampling is a form of non-universal quantum computing that has been
considered a promising candidate for showing experimental quantum advantage. While …
considered a promising candidate for showing experimental quantum advantage. While …
Quantum computing of fluid dynamics using the hydrodynamic Schrödinger equation
Simulating fluid dynamics on a quantum computer is intrinsically difficult due to the nonlinear
and non-Hamiltonian nature of the Navier-Stokes equation (NSE). We propose a framework …
and non-Hamiltonian nature of the Navier-Stokes equation (NSE). We propose a framework …