For quantum computers to successfully solve real-world problems, it is necessary to tackle
the challenge of noise: the errors that occur in elementary physical components due to …

The rapid pace of development in quantum computing technology has sparked a
proliferation of benchmarks to assess the performance of quantum computing hardware and …

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 …

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 …

Grover's algorithm is one of the primary algorithms offered as evidence that quantum
computers can provide an advantage over classical computers. It involves an …

In recent years, research in quantum computing has largely focused on two approaches:
near-term intermediate-scale quantum (NISQ) computing and future fault-tolerant quantum …

A key challenge in the effort to simulate today's quantum computing devices is the ability to
learn and encode the complex correlations that occur between qubits. Emerging …

Efficient simulation of quantum computers relies on understanding and exploiting the
properties of quantum states. This is the case for methods such as tensor networks, based …

We show how quantum-inspired 2D tensor networks can be used to efficiently and
accurately simulate the largest quantum processors from IBM, namely Eagle (127 qubits) …

Effectively compressing and optimizing tensor networks requires reliable methods for fixing
the latent degrees of freedom of the tensors, known as the gauge. Here we introduce a new …