English
Related papers

Related papers: Clever Design, Unexpected Obstacles: Insights on I…

200 papers

A central challenge for implementing quantum computing in the solid state is decoupling the qubits from the intrinsic noise of the material. We investigate the implementation of quantum gates for a paradigmatic, non-Markovian model: A…

Quantum Physics · Physics 2010-04-22 P. Rebentrost , I. Serban , T. Schulte-Herbrueggen , F. K. Wilhelm

In the noisy intermediate-scale quantum (NISQ) era, flexible quantum operations are essential for advancing large-scale quantum computing, as they enable shorter circuits that mitigate decoherence and reduce gate errors. However, the…

Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…

Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum…

We explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large scale classical diagonalization of the nuclear shell model have reached sizes of $10^9 - 10^{10}$ basis states, but are…

Nuclear Theory · Physics 2022-07-11 I. Stetcu , A. Baroni , J. Carlson

Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…

Quantum Physics · Physics 2026-02-10 Amir Kalev , Itay Hen

We investigate the problem of factorization of large numbers on a quantum computer which we imagine to be realized within a linear ion trap. We derive upper bounds on the size of the numbers that can be factorized on such a quantum…

Quantum Physics · Physics 2009-10-30 M. B. Plenio , P. L. Knight

The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…

Quantum Physics · Physics 2009-11-13 K. G. H. Vollbrecht , J. I. Cirac

Currently available quantum computing hardware platforms have limited 2-qubit connectivity among their addressable qubits. In order to run a generic quantum algorithm on such a platform, one has to transform the initial logical quantum…

Quantum Physics · Physics 2020-04-28 Beatrice Nash , Vlad Gheorghiu , Michele Mosca

Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…

Quantum Physics · Physics 2016-07-22 Esteban A. Martinez , Thomas Monz , Daniel Nigg , Philipp Schindler , Rainer Blatt

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We…

Quantum Physics · Physics 2020-12-16 Lin Lin , Yu Tong

Many promising applications of quantum computing with a provable speedup center around the HHL algorithm. Due to restrictions on the hardware and its significant demand on qubits and gates in known implementations, its execution is…

The development of quantum computing technologies builds on the unique features of quantum physics while borrowing familiar principles from the design of conventional devices. We introduce the fundamental concepts required for designing and…

Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…

Quantum Physics · Physics 2025-01-10 Yotam Shapira , Jovan Markov , Nitzan Akerman , Ady Stern , Roee Ozeri

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…

Quantum Physics · Physics 2025-04-01 Titus D. Morris , Ananth Kaushik , Martin Roetteler , Phillip C. Lotshaw

We describe a simple quantum algorithm to simulate time-dependent Hamiltonian, extending the methodology of quantum signal processing. The framework achieves optimal scaling up to some factor with respect to other parameters, and nearly…

Quantum Physics · Physics 2025-03-11 Nhat A. Nghiem

Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have…

Quantum Physics · Physics 2007-05-23 G. Florio , D. Picca

Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science and becomes especially challenging for high-dimensional complex structure problems. One specific issue is that of quantum process…

Quantum Physics · Physics 2024-04-30 Daniel Volya , Andrey Nikitin , Prabhat Mishra

The past decade has witnessed significant advancements in quantum hardware, encompassing improvements in speed, qubit quantity, and quantum volume-a metric defining the maximum size of a quantum circuit effectively implementable on…

Quantum Physics · Physics 2024-06-11 Yaswitha Gujju , Atsushi Matsuo , Rudy Raymond

We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…