Related papers: Efficiency of Feynman's quantum computer
Enhancing the lifetime of qubits with quantum code-based memories on different quantum hardware is a significant step towards fault-tolerant quantum computing. We theoretically show that the break-even point, i.e., preserving arbitrary…
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps - quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, seeking for…
We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers, addressing key challenges in the field. In contrast to existing approaches, our method achieves…
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum…
Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing as a feasibility problem for the Hamiltonian model and then solving…
Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and readout, quantum logic gates and controlled…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
As various quantum computing technologies continue to compete for quantum supremacy, several parameters have emerged as benchmarks for the quality of qubits. These include fidelity, coherence times, connectivity, and a few others. In this…
Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical…
First solid state quantum computer was built using transmons (cooper pair boxes). The operation of the computer is limited because of using a number of the rigit cooper boxes working with fixed frequency at temperatures of superconducting…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement…
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection…