Harnessing techniques from analog signal processing, we establish a new path for large-scale quantum computation.
We describe and implement a family of entangling gates activated by radio-frequency flux modulation applied to a tunable transmon that is statically coupled to a neighboring transmon. The effect of this modulation is the resonant exchange of photons directly between levels of the two-transmon system, obviating the need for mediating qubits or resonator modes and allowing for the full utilization of all qubits in a scalable architecture. The resonance condition is selective in both the frequency and amplitude of modulation and thus alleviates frequency crowding. We demonstrate the use of three such resonances to produce entangling gates that enable universal quantum computation: one iSWAP gate and two distinct controlled Z gates. We report interleaved randomized benchmarking results indicating gate error rates of 6% for the iSWAP (duration 135ns) and 9% for the controlled Z gates (durations 175 ns and 270 ns), limited largely by qubit coherence.A central challenge in building a scalable quantum computer with superconducting qubits is the execution of high-fidelity, two-qubit gates within an architecture containing many resonant elements. As more elements are added, or as the multiplicity of couplings between elements is increased, the frequency space of the design becomes crowded and device performance suffers. In architectures composed of transmon qubits [1], there are two main approaches to implementing two-qubit gates. The first utilizes fixed-frequency qubits with static couplings where the two-qubit operations are activated by applying transverse microwave drives [2][3][4][5][6][7][8]. While fixedfrequency qubits generally have long coherence times, this architecture requires satisfying stringent constraints on qubit frequencies and anharmonicities [5,6,8] which requires some tunability to scale to many qubits [9]. The second approach relies on frequency-tunable transmons, and two-qubit gates are activated by tuning qubits into and out of resonance with a particular transition [10][11][12][13][14][15][16]. However, tunability comes at the cost of additional decoherence channels, thus significantly limiting coherence times [17]. In this approach the delivery of shaped unbalanced control signals poses a challenge [15]. Such gates are furthermore sensitive to frequency crowdingavoiding unwanted crossings with neighboring qubit energy levels during gate operations limits the flexibility and connectivity of the architecture.An alternative to these approaches is to modulate a circuit's couplings or energy levels at a frequency corresponding to the detuning between particular energy levels of interest [18][19][20][21][22][23][24][25][26]. This enables an entangling gate between a qubit and a single resonator [21,22], a qubit and many resonator modes [26], two transmon qubits coupled by a tunable mediating qubit [16,25], or two tunable transmons coupled to a mediating resonator [23,24].Building on these earlier results, we implement two entangling gates, iSWAP and controlled Z (CZ), between a flux-tunable transmon an...
In order to support near-term applications of quantum computing, a new compute paradigm has emerged-the quantum-classical cloud-in which quantum computers (QPUs) work in tandem with classical computers (CPUs) via a shared cloud infrastructure. In this work, we enumerate the architectural requirements of a quantum-classical cloud platform, and present a framework for benchmarking its runtime performance. In addition, we walk through two platform-level enhancements, parametric compilation and active qubit reset, that specifically optimize a quantumclassical architecture to support variational hybrid algorithms (VHAs), the most promising applications of near-term quantum hardware. Finally, we show that integrating these two features into the Rigetti Quantum Cloud Services (QCS) platform results in considerable improvements to the latencies that govern algorithm runtime. ‡ Current address: OpenAI,
To test installation, one can run the following. 1 import mitiq 2 mitiq . about () Codeblock 2. Testing installation & viewing package versions.This code prints information about the Mitiq version, versions of installed packages, and installation path.
Noisy intermediate-scale quantum computing devices are an exciting platform for the exploration of the power of near-term quantum applications. Performing nontrivial tasks in such a framework requires a fundamentally different approach than what would be used on an error-corrected quantum computer. One such approach is to use hybrid algorithms, where problems are reduced to a parameterized quantum circuit that is often optimized in a classical feedback loop. Here we described one such hybrid algorithm for machine learning tasks by building upon the classical algorithm known as random kitchen sinks. Our technique, called quantum kitchen sinks, uses quantum circuits to nonlinearly transform classical inputs into features that can then be used in a number of machine learning algorithms. We demonstrate the power and flexibility of this proposal by using it to solve binary classification problems for synthetic datasets as well as handwritten digits from the MNIST database. We can show, in particular, that small quantum circuits provide significant performance lift over standard linear classical algorithms, reducing classification error rates from 50% to < 0.1%, and from 4.1% to 1.4% in these two examples, respectively.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.