When working to understand quantum systems engineering, there are many constraints to building a scalable quantum computer. Here I discuss a constraint on the qubit control system from an information point of view, showing that the large amount of information needed for the control system will put significant constraints on the control system. The size the qubits is conjectured to be an important systems parameter.
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the effective number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.
We demonstrate a strategy for implementation a quantum full adder in a spin chain quantum computer. As an example, we simulate a quantum full adder in a chain containing 201 spins. Our simulations also demonstrate how one can minimize errors generated by non-resonant effects.
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. The phase and probability errors caused by unwanted transitions are minimized and computed numerically.
Increasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements for scalable entanglement-swapping. First, we demonstrate quantum correlations that defy classical models in up to nine-qubit systems while only assuming that the quantum computer operates on qubits. Harvesting these quantum adva…
So far, superconducting quantum computers have certain constraints on qubit connectivity, such as nearest-neighbor couplings. To overcome this limitation, we propose a scalable architecture to simultaneously connect several pairs of distant qubits via a dispersively coupled quantum bus. The building-block of the bus is composed of orthogonal coplanar waveguide resonators connected through ancillary flux qubits working in the ultrastrong coupling regime. This regime activates virtual processes that boost the effective qubit-qubit interaction, which results in quantum gates on the nanosecond tim…
We present a scalable scheme for superconducting charge qubits with the assistance of one-dimensional superconducting transmission line resonator (STLR) playing the role of data bus. The coupling between qubit and data bus may be turned on and off by just controlling the gate voltage and externally applied flux of superconducting charge qubit. In our proposal, the entanglement between arbitrary two qubits and $W$ states of three qubits can be generated quickly and easily.
We describe a scalable, high-speed, and robust architecture for measurement-based quantum-computing with trapped ions. Measurement-based architectures offer a way to speed-up operation of a quantum computer significantly by parallelizing the slow entangling operations and transferring the speed requirement to fast measurement of qubits. We show that a 3D cluster state suitable for fault-tolerant measurement-based quantum computing can be implemented on a 2D array of ion traps. We propose the projective measurement of ions via multi-photon photoionization for nanosecond operation and discuss th…
We propose a new quantum-computing scheme using ultracold neutral ytterbium atoms in an optical lattice. The nuclear Zeeman sublevels define a qubit. This choice avoids the natural phase evolution due to the magnetic dipole interaction between qubits. The Zeeman sublevels with large magnetic moments in the long-lived metastable state are also exploited to address individual atoms and to construct a controlled-multiqubit gate. Estimated parameters required for this scheme show that this proposal is scalable and experimentally feasible.
We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total spin of isolators is 0. There are no need of complicated protocols for correcting the phase and probability errors due to permanent interaction between the qubits. We present protocols for implementation of universal quantum gates with the rectangular radio-frequency pulses.
The errors caused by the transitions with large frequency offsets (nonresonant transitions) are calculated analytically for a scalable solid-state quantum computer based on a one-dimensional spin chain with Ising interactions between neighboring spins. Selective excitations of the spins are enabled by a uniform gradient of the external magnetic field. We calculate the probabilities of all unwanted nonresonant transitions associated with the flip of each spin with nonresonant frequency and with flips of two spins: one with resonant and one with nonresonant frequencies. It is shown that these er…
The first generation of quantum computers are on the horizon, fabricated from quantum hardware platforms that may soon be able to tackle certain tasks that cannot be performed or modelled with conventional computers. These quantum devices will not likely be universal or fully programmable, but special-purpose processors whose hardware will be tightly co-designed with particular target applications. Trapped atomic ions are a leading platform for first generation quantum computers, but are also fundamentally scalable to more powerful general purpose devices in future generations. This is because…
Recent development in quantum information sciences and technologies, especially building programmable quantum computers, provide us new opportunities to study fundamental aspects of quantum mechanics. We propose qubit models to emulate the quantum measurement process, in which the quantum information of a qubit is mapped to a collection of qubits acting as the measurement device. One model is motivated by single-photon detection and the other by spin measurement. Both models are scalable to generate Schrödinger cat-like state, and their corresponding quantum circuits are shown explicitly. Larg…
A major challenge for quantum computation in ion trap systems is scalable integration of error correction and fault tolerance. We analyze a distributed architecture with rapid high fidelity local control within nodes and entangled links between nodes alleviating long-distance transport. We demonstrate fault-tolerant operator measurements which are used for error correction and non-local gates. This scheme is readily applied to linear ion traps which cannot be scaled up beyond a few ions per individual trap but which have access to a probabilistic entanglement mechanism. A proof-of-concept syst…
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical models of the latency, bandwidth, error rate and resource utilization of such channels, and show that 100s of qubits must be distributed to accommodate a single data communication. Next, we show that a grid of teleportation nodes forms a good substrate on which to distribute EPR pairs. We also explore the control requirements for such a network. Finally, we propose a specific routing architecture and simulate the commun…
We propose a scalable neutral atom quantum computer with an on-demand interaction. Artificial lattice of near field optical traps is employed to trap atom qubits. Interactions between atoms can be turned off if the atoms are separated by a high enough potential barrier so that the size of the atomic wave function is much less than the interatomic distance. One-qubit gate operation is implemented by a gate control laser beam which is attached to an individual atom. Two-qubit gate operation between a particular pair of atoms is introduced by leaving these atoms in an optical lattice and making t…
We consider a one-dimensional chain of many superconducting quantum interference devices (SQUIDs), serving as charge qubits. Each SQUID is coupled to its nearest neighbors through constant capacitances. We study the quantum logic operations and implementation of entanglement in this system. Arrays with two and three qubits are considered in detail. We show that the creation of entanglement with an arbitrary number of qubits can be implemented, without systematic errors, even when the coupling between qubits is not small. A relatively large coupling constant allows one to increase the clock spe…
Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into states of light and the modern tools for their generation. Here we propose such a design for a scalable and fault-tolerant photonic quantum computer informed by the latest developments in theory and technology. Central to our architecture is the generation and manipulation of three-dimensional hybrid resource states comprising both bosonic qubits and squeezed v…
We present a method for mitigating measurement errors on quantum computing platforms that does not form the full assignment matrix, or its inverse, and works in a subspace defined by the noisy input bit-strings. This method accommodates both uncorrelated and correlated errors, and allows for computing accurate error bounds. Additionally, we detail a matrix-free preconditioned iterative solution method that converges in $\mathcal{O}(1)$ steps that is performant and uses orders of magnitude less memory than direct factorization. We demonstrate the validity of our method, and mitigate errors in a…
The performance of quantum gates is often assessed using some form of randomized benchmarking. However, the existing methods become infeasible for more than approximately five qubits. Here we show how to use a simple and customizable class of circuits -- randomized mirror circuits -- to perform scalable, robust, and flexible randomized benchmarking of Clifford gates. We show that this technique approximately estimates the infidelity of an average many-qubit logic layer, and we use simulations of up to 225 qubits with physically realistic error rates in the range 0.1-1% to demonstrate its scala…
We present here algorithmic cooling (via polarization-heat-bath)- a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by employing a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Cooling spins to a very low temperature without cooling the environment cou…
Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio frequency pulses. Existing proposals, however, suffer from a signal-to-noise ratio that decays exponentially in the number of qubits in the quantum computer. This places a severe limit on the size of the computations that can be performed by such a computer; estimates of that limit are well within the range in which a conventional computer taking exponentially …
We propose a scalable and robust architecture for one-way quantum computation using coupled networks of superconducting transmission line resonators. In our protocol, quantum information is encoded into the long-lived photon states of the resonators, which have a much longer coherence time than the usual superconducting qubits. Each resonator contains a charge qubit used for the state initialization and local projective measurement of the photonic qubit. Any pair of neighboring photonic qubits are coupled via a mediator charge qubit, and large photonic cluster states can be created by applying…
Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them. Modular ion trap quantum computer architectures address scalability by constructing individual quantum processors interconnected via a network of quantum communication channels. Successful operation of such quantum hardware requires a fully programmable classical control system capable of frequency stabilizing the continuous wave lasers necessary for trapping and cooling the ion qubits, stabilizing the optical frequency combs used to dri…
We consider the effects of decoherence on Landau-Zener crossings encountered in a large-scale adiabatic-quantum-computing setup. We analyze the dependence of the success probability, i.e. the probability for the system to end up in its new ground state, on the noise amplitude and correlation time. We determine the optimal sweep rate that is required to maximize the success probability. We then discuss the scaling of decoherence effects with increasing system size. We find that those effects can be important for large systems, even if they are small for each of the small building blocks.
We propose a scalable neutral atom quantum computer with an on-demand interaction through a selective two-qubit gate operation. Atoms are trapped by a lattice of near field Fresnel diffraction lights so that each trap captures a single atom. One-qubit gate operation is implemented by a gate control laser beam which is applied to an individual atom. Two-qubit gate operation between an arbitrary pair of atoms is implemented by sending these atoms to a state-dependent optical lattice and making them collide so that a particular two-qubit state acquires a dynamical phase. We give numerical evaluat…
Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment,(ii) non-selective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically an…
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the reach of near-term quantum hardware. Here we show experimentally that an efficient, low-depth variational quantum algorithm with few parameters can reproduce important qualitative features of medium-size instances of the Fermi-Hubbard model. We address 1x8 and 2x4 instances on 16 qubits on a superconducting quantum processor, substantially larger than previous w…
Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states. It is a crucial resource for quantum computing and a necessary condition for quantum advantage. However, quantifying magic resource beyond a few qubits has been a major challenge. Here, we introduce efficient measures of magic resource for pure quantum states with a sampling cost that is independent of the number of qubits. Our method uses Bell measurements over two copies of a state, which we implement in experiment together with a cost-free error mitigation scheme. We sh…
Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in 1994 that Peter Shor came up with an algorithm that is able to calculate the prime factors of a large number vastly more efficiently than known possible with a classical computer. This paradigmatic algorithm stimulated the flourishing research in quantum information processing and the quest for an actual implementation of a quantum computer. Over the last fi…
Clifford Volume and Free Fermion Volume: Complementary Scalable Benchmarks for Quantum Computers
HUN-REN Wigner Research Centre for Physics（匈牙利科学院维格纳物理研究中心）；Eötvös Loránd University（厄特沃什·罗兰大学）；University of Innsbruck（因斯布鲁克大学）；Alpine Quantum Technologies GmbH（阿尔卑斯量子技术有限责任公司）；QTF Centre of Excellence, Department of Physics, University of Helsinki（赫尔辛基大学物理系量子技术卓越中心）；Algorithmiq Ltd.（Algorithmiq有限公司）
Several authors have described the basic requirements essential to build a scalable quantum computer. Because many physical implementation schemes for quantum computing rely on nearest neighbor interactions, there is a hidden quantum communication overhead to connect distant nodes of the computer. In this paper we propose a physical solution to this problem which, together with the key building blocks, provides a pathway to a scalable quantum architecture using nonlocal interactions. Our solution involves the concept of a quantum bus that acts as a refreshable entanglement resource to connect …
The availability of a universal quantum computer will have fundamental impact on a vast number of research fields and society as a whole. An increasingly large scientific and industrial community is working towards the realization of such a device. An arbitrarily large quantum computer is best constructed using a modular approach. We present a blueprint for a trapped-ion based scalable quantum computer module which makes it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are c…
Recent advances in solid-state qubit technology are paving the way to fault-tolerant quantum computing systems. However, qubit technology is limited by qubit coherence time and by the complexity of coupling the quantum system with a classical electronic infrastructure. We propose an infrastructure, enabling to read and control qubits, that is implemented on a field-programmable gate array (FPGA). The FPGA platform supports functionality required by several qubit technologies and can operate physically close to the qubits over a temperature range from 4K to 300K. Extensive characterization of t…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum computers hold the promise of transcending such limitations although in the current era the size and noise of these devices militates against significant progress. Here we describe a new and chemically intuitive approach that permits a subdomain of the electronic structure of a molecule to be calculated accurately on a quantum device, while the rest of the mol…
Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear interaction between the two photons, and the efficiency of this nonlinear interaction is typically very tiny in bulk materials. However, we recently have shown that this barrier can be circumvented with effective nonlinearities produced by projective measurements, and with this work linear-optical quantum computing becomes a new possibility of scalable quantum compu…
In this paper we examine the use of an adiabatic quantum data transfer protocol to build a universal quantum computer. Single qubit gates are realized by using a bus protocol to transfer qubits of information down a spin chain with a unitary twist. This twist arises from altered couplings on the chain corresponding to unitary rotations performed on one region of the chain. We show how a controlled NOT gate can be realized by using a control qubit with Ising type coupling. The method discussed here can be extended to non-adiabatic quantum bus protocols. We also examine the potential of realizin…
Boson sampling is a problem intractable for classical computers, but can be naturally solved on a specialized photonic quantum simulator which requires less resources than building a universal quantum computer. The biggest challenge to implement boson sampling with a large number of photons has been the lack of reliable single-photon sources. Here we demonstrate a scalable architecture of boson sampling using a solid-state single-photon source with simultaneously high efficiency, purity, and indistinguishability. The single photons are time-bin encoded and interfered in an electrically program…
Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
Institute for Quantum Computing, University of Waterloo（量子计算研究所，滑铁卢大学）；David R. Cheriton School of Computer Science, University of Waterloo（大卫·R·切里顿计算机科学学院，滑铁卢大学）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）；Department of Physics and Astronomy, University of Waterloo（物理与天文学系，滑铁卢大学）
Tremendous efforts have been paid for realization of fault-tolerant quantum computation so far. However, preexisting fault-tolerant schemes assume that a lot of qubits live together in a single quantum system, which is incompatible with actual situations of experiment. Here we propose a novel architecture for practically scalable quantum computation, where quantum computation is distributed over small-size (four-qubit) local systems, which are connected by quantum channels. We show that the proposed architecture works even with the error probability 0.1% of local operations, which breaks throu…
We investigate how to concatenate different decoherence-free subspaces (DFSs) to realize scalable universal fault-tolerant quantum computation. Based on tunable $XXZ$ interactions, we present an architecture for scalable quantum computers which can fault-tolerantly perform universal quantum computation by manipulating only single type of parameter. By using the concept of interaction-free subspaces we eliminate the need to tune the couplings between logical qubits, which further reduces the technical difficulties for implementing quantum computation.
Superconducting quantum computers (SQC) can solve some specific problems which are deeply believed to be intractable for classical computers. The control and measurement of qubits can't go on without the synchronous operation of digital-to-analog converters (DAC) array and the controlled sampling of analog-to-digital converters (ADC). In this paper, a scalable self-adaptive synchronous triggering system is proposed to ensure the synchronized operation of multiple qubits. The skew of the control signal between different qubits is less than 25 ps. After upgrading the clock design, the 250 MHz si…
In the near-term "NISQ"-era of noisy, intermediate-scale, quantum hardware and beyond, reliably determining the quality of quantum devices becomes increasingly important: users need to be able to compare them with one another, and make an estimate whether they are capable of performing a given task ahead of time. In this work, we develop and release an advanced quantum benchmarking framework in order to help assess the state of the art of current quantum devices. Our testing framework measures the performance of universal quantum devices in a hardware-agnostic way, with metrics that are aimed …
The control of cryogenic qubits in today's superconducting quantum computer prototypes presents significant scalability challenges due to the massive costs of generating/routing the analog control signals that need to be sent from a classical controller at room temperature to the quantum chip inside the dilution refrigerator. Thus, researchers in industry and academia have focused on designing in-fridge classical controllers in order to mitigate these challenges. Superconducting Single Flux Quantum (SFQ) is a classical logic family proposed for large-scale in-fridge controllers. SFQ logic has …
