English
Related papers

Related papers: Demonstration of Two-Qubit Algorithms with a Super…

200 papers

The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…

Existing and near-term quantum computers can only perform two-qubit gates between physically connected qubits. Research has been done on compilers to rewrite quantum programs to match hardware constraints. However, the quantum processor…

Quantum Physics · Physics 2022-07-05 Wei Hu , Yang Yang , Weiye Xia , Jiawei Pi , Enyi Huang , Xin-Ding Zhang , Hua Xu

Three-qubit gates are highly beneficial operations in quantum computing, enabling compact implementations of quantum algorithms and efficient generation of multipartite entangled states. However, realizing such gates with high fidelity…

Quantum Physics · Physics 2026-01-19 Guangze Chen , Anton Frisk Kockum

Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…

Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in…

Quantum Physics · Physics 2016-05-04 Henry Semenenko , Tim Byrnes

We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically…

Quantum Physics · Physics 2009-11-10 Shi-Liang Zhu , Z. D. Wang , Paolo Zanardi

In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…

We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…

Quantum Physics · Physics 2023-07-28 D. D. Yavuz , A. Yadav

We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled spin-1/2…

In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…

Quantum Physics · Physics 2009-11-10 Mikio Nakahara , Yasushi Kondo , Kazuya Hata , Shogo Tanimura

Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…

Quantum Physics · Physics 2024-01-10 Gayathree M. Vinod , Anil Shaji

The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…

Quantum Physics · Physics 2010-01-04 D. Hanneke , J. P. Home , J. D. Jost , J. M. Amini , D. Leibfried , D. J. Wineland

Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…

Quantum Physics · Physics 2009-11-13 T. Monz , K. Kim , W. Hänsel , M. Riebe , A. Villar , P. Schindler , M. Chwalla , M. Hennrich , R. Blatt

Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both…

Mesoscale and Nanoscale Physics · Physics 2016-08-31 Michael N. Leuenberger , Daniel Loss

Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a…

Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs…

Quantum Physics · Physics 2022-09-26 Wenrui Mu , Ying Mao , Long Cheng , Qingle Wang , Weiwen Jiang , Pin-Yu Chen

Two-level system fluctuators in superconducting devices have demonstrated coherent coupling with superconducting qubits. Here, we show that universal quantum logic gates can be realized in these two-level systems solely by tuning a…

Quantum Physics · Physics 2009-11-13 L. Tian , K. Jacobs

Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have…

We propose the implementation of fast resonant gates in circuit quantum electrodynamics for quantum information processing. We show how a suitable utilization of three-level superconducting qubits inside a resonator constitutes a key tool…

Mesoscale and Nanoscale Physics · Physics 2015-05-14 G. Haack , F. Helmer , M. Mariantoni , F. Marquardt , E. Solano

The faster speed and operational convenience of two-qubit gate with flux bias control makes it an important candidate for future large-scale quantum computers based on high coherence flux qubits. Based on a properly designed two-spin gadget…

Quantum Physics · Physics 2022-01-20 Rui Yang
‹ Prev 1 3 4 5 6 7 10 Next ›