Short dephasing times pose one of the main challenges in realizing a quantum computer. Different approaches have been devised to cure this problem for superconducting qubits, a prime example being the operation of such devices at optimal working points, so-called "sweet spots." This latter approach led to significant improvement of T2 times in Cooper pair box qubits [D. Vion et al., Science 296, 886 (2002)]. Here, we introduce a new type of superconducting qubit called the "transmon." Unlike the charge qubit, the transmon is designed to operate in a regime of significantly increased ratio of Josephson energy and charging energy EJ /EC. The transmon benefits from the fact that its charge dispersion decreases exponentially with EJ /EC , while its loss in anharmonicity is described by a weak power law. As a result, we predict a drastic reduction in sensitivity to charge noise relative to the Cooper pair box and an increase in the qubit-photon coupling, while maintaining sufficient anharmonicity for selective qubit control. Our detailed analysis of the full system shows that this gain is not compromised by increased noise in other known channels.

Quantum computers can be used to address molecular structure, materials science and condensed matter physics problems, which currently stretch the limits of existing high-performance computing resources [1]. Finding exact numerical solutions to these interacting fermion problems has exponential cost, while Monte Carlo methods are plagued by the fermionic sign problem. These limitations of classical computational methods have made even few-atom molecular structures problems of practical interest for medium-sized quantum computers.Yet, thus far experimental implementations have been restricted to molecules involving only Period I elements [2][3][4][5][6][7][8]. Here, we demonstrate the experimental optimization of up to six-qubit Hamiltonian problems with over a hundred Pauli terms, determining the ground state energy for molecules of increasing size, up to BeH 2 . This is enabled by a hardware-efficient variational quantum eigensolver with trial states specifically tailored to the available interactions in our quantum processor, combined with a compact encoding of fermionic Hamiltonians [9] and a robust stochastic optimization routine [10]. We further demonstrate the flexibility of our approach by applying the technique to a problem of quantum magnetism [11]. Across all studied problems, we find agreement between experiment and numerical simulations with a noisy model of the device. These results help elucidate the requirements for scaling the method to larger systems, and aim at bridging the gap between problems at the forefront of high-performance computing and their implementation on quantum hardware.The fundamental goal of addressing molecular structure problems is to solve for the ground state energy of many-body interacting fermionic Hamiltonians. Solving this problem on a quantum computer relies on a mapping between fermionic and qubit operators [12]. This restates it as a specific instance of a local Hamiltonian problem on a set of qubits. Given a k-local Hamiltonian H, composed of terms that act on at most k qubits, the solution to the local Hamiltonian problem amounts to finding its * These authors contributed equally to this work.smallest eigenvalue E G ,To date, no efficient algorithm is known that can solve this problem in full generality. For k ≥ 2 the problem is known to be QMA-complete [13]. However, it is expected that physical systems have Hamiltonians that do not constitute hard instances of this problem, and can be solved efficiently on a quantum computer, while remaining hard to solve classically. Following Feynman's idea for quantum simulation, a quantum algorithm for the ground state problem of interacting fermions was proposed in [14] and [15]. The approach relies on a good initial state that has a large overlap with the ground state and then solves the problem using the quantum phase estimation algorithm (PEA) [16]. While PEA has been demonstrated to achieve extremely accurate energy estimates for quantum chemistry [2, 3, 5, 8], it applies stringent requirements on quantum coherence.An a...

Machine learning and quantum computing are two technologies each with the potential for altering how computation is performed to address previously untenable problems. Kernel methods for machine learning are ubiquitous for pattern recognition, with support vector machines (SVMs) being the most well-known method for classification problems. However, there are limitations to the successful solution to such problems when the feature space becomes large, and the kernel functions become computationally expensive to estimate. A core element to computational speed-ups afforded by quantum algorithms is the exploitation of an exponentially large quantum state space through controllable entanglement and interference.Here, we propose and experimentally implement two novel methods on a superconducting processor. Both methods represent the feature space of a classification problem by a quantum state, taking advantage of the large dimensionality of quantum Hilbert space to obtain an enhanced solution. One method, the quantum variational classifier builds on [1, 2] and operates through using a variational quantum circuit to classify a training set in direct analogy to conventional SVMs. In the second, a quantum kernel estimator, we estimate the kernel function and optimize the classifier directly. The two methods present a new class of tools for exploring the applications of noisy intermediate scale quantum computers [3] to machine learning.The intersection between machine learning and quantum computing has been dubbed quantum machine learning, and has attracted considerable attention in recent years [4][5][6]. This has led to a number of recently proposed quantum algorithms [1,2,[7][8][9]. Here, we present a quantum algorithm that has the potential to run on near-term quantum devices. A natural class of algorithms for such noisy devices are short-depth circuits, which are amenable to error-mitigation techniques that reduce the effect of decoherence [10,11]. There are convincing arguments that indicate that even very sim- ple circuits are hard to simulate by classical computational means [12,13]. The algorithm we propose takes on the original problem of supervised learning: the construction of a classifier. For this problem, we are given data from a training set T and a test set S of a subset Ω ⊂ R d . Both are assumed to be labeled by a map m : T ∪ S → {+1, −1} unknown to the algorithm. The training algorithm only receives the labels of the training data T . The goal is to infer an approximate map on the test setm : S → {+1, −1} such that it agrees with high probability with the true map m( s) =m( s) on the test data s ∈ S. For such a learning task to be meaningful it is assumed that there is a correlation between the labels given for training and the true map. A classical approach to constructing an approximate labeling function uses socalled support vector machines (SVMs) [14]. The data gets mapped non-linearly to a high dimensional space, the feature space, where a hyperplane is constructed to separate the labeled samples. ...

Superconducting circuits are promising candidates for constructing quantum bits (qubits) in a quantum computer; single-qubit operations are now routine 1,2 , and several examples 3,4,5,6,7,8,9 of two qubit interactions and gates having been demonstrated. These experiments show that two nearby qubits can be readily coupled with local interactions. Performing gates between an arbitrary pair of distant qubits is highly desirable for any quantum computer architecture, but has not yet been demonstrated. An efficient way to achieve this goal is to couple the qubits to a quantum bus, which distributes quantum information among the qubits. Here we show the implementation of such a quantum bus, using microwave photons confined in a transmission line cavity, to couple two superconducting qubits on opposite sides of a chip. The interaction is mediated by the exchange of virtual rather than real photons, avoiding cavity induced loss. Using fast control of the qubits to switch the coupling effectively on and off, we demonstrate coherent transfer of quantum states between the qubits. The cavity is also used to perform multiplexed control and measurement of the qubit states. This approach can be expanded to more than two qubits, and is an attractive architecture for quantum information processing on a chip.There are several physical systems in which one could realize a quantum bus. A particular example is trapped ions 10,11 in which a variety of quantum operations and algorithms have been performed using the quantized motion of the ions (phonons) as the bus. Photons are another natural candidate as a carrier of quantum information 12,13 , because they are highly coherent and can mediate interactions between distant objects. To create a photon bus, it is helpful to utilize the increased interaction strength provided by the techniques of cavity quantum electrodynamics, where an atom is coupled to a single cavity mode. In the strong coupling limit 14 the interaction is coherent, permitting the transfer of quantum information between the atom and the photon. Entanglement between atoms has been demonstrated with Rydberg atom cavity QED 15,16,17 . Circuit QED 18 is a realization of the physics of cavity QED with superconducting qubits coupled to a microwave cavity on a chip. Previous circuit QED experiments with single qubits have achieved 19 the strong coupling limit and have demonstrated 20 the transfer of quantum information from qubit to photon. Here we perform a circuit QED experiment with two qubits strongly coupled to a cavity, and demonstrate a coherent, non-local coupling between the qubits via this bus.Operations with multiple superconducting qubits have been performed and are a subject of current research. The first solid-state quantum gate has been demonstrated with charge qubits 3 . For flux qubits, two-qubit coupling 5 and a controllable coupling mechanism have been realized 7,8,9 . Two phase qubits have also been successfully coupled 4 and the entanglement between them has been observed 6 . All of these interactions h...

Quantum computers, which harness the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact-such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized register of qubits, which coherently evolves into a final state containing the result of the computation. Building a quantum processor is challenging because of the need to meet simultaneously requirements that are in conflict: state preparation, long coherence times, universal gate operations and qubit readout. Processors based on a few qubits have been demonstrated using nuclear magnetic resonance, cold ion trap and optical systems, but a solid-state realization has remained an outstanding challenge. Here we demonstrate a two-qubit superconducting processor and the implementation of the Grover search and Deutsch-Jozsa quantum algorithms. We use a two-qubit interaction, tunable in strength by two orders of magnitude on nanosecond timescales, which is mediated by a cavity bus in a circuit quantum electrodynamics architecture. This interaction allows the generation of highly entangled states with concurrence up to 94 per cent. Although this processor constitutes an important step in quantum computing with integrated circuits, continuing efforts to increase qubit coherence times, gate performance and register size will be required to fulfil the promise of a scalable technology.