The engineering challenges in quantum computing

Almudéver, Carmen G.; Lao, Lingling; Fu, Xiang; Khammassi, N.; Ashraf, Imran; Iorga, Dan; Varsamopoulos, Savvas; Eichler, Christopher; Wallraff, Andreas; Geck, Lotte; Kruth, A.; Knoch, J.; Bluhm, Hendrik; Bertels, Koen

doi:10.23919/date.2017.7927104

Cited by 78 publications

(48 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Also, the resources for technically more difficult operations such as microwave control and other fast pulses put constraints on a scalable classical control. The parallel and routed application of electrical signals is therefore necessary and dictates the way quantum gates can be applied to the qubits [63][64][65].…”

Section: Higher Levelsmentioning

confidence: 99%

Rent’s rule and extensibility in quantum computing

Franke

Clarke

Vandersypen

et al. 2019

Microprocessors and Microsystems

View full text Add to dashboard Cite

Quantum computing is on the verge of a transition from fundamental research to practical applications. Yet, to make the step to large-scale quantum computation, an extensible qubit system has to be developed. In classical semiconductor technology, this was made possible by the invention of the integrated circuit, which allowed to interconnect large numbers of components without having to solder to each and every one of them. Similarly, we expect that the scaling of interconnections and control lines with the number of qubits will be a central bottleneck in creating large-scale quantum technology. Here, we define the quantum Rent's exponent p to quantify the progress in overcoming this challenge at different levels throughout the quantum computing stack. We further discuss the concept of quantum extensibility as an indicator of a platform's potential to reach the large quantum volume needed for universal quantum computing and review extensibility limits faced by different qubit implementations on the way towards truly large-scale qubit systems. I. THE TYRANNY OF NUMBERSOne of the most significant advances in the field of quantum computation has been the invention of quantum error correction (QEC) [1][2][3]. While quantum bits (qubits) are delicate systems, these algorithms can enable fault-tolerant quantum computation with sophisticated correction codes tolerating error rates of up to 1% [2]. Similar values are already achieved or within reach for experimentally observed qubit infidelities across a range of different platforms [4][5][6][7][8][9][10][11]. However, a tradeoff between the tolerated error rates and the number of qubits has to be made. Quantum error correction can lead to an overhead between 10 3 and 10 4 physical qubits per logical qubit [2,12], such that millions or even billions of physical qubits will be required for practical applications. To host and control this daunting number of qubits, formidable requirements have to be met by different elements of the system, including interconnects, control electronics and quantum software. It is therefore essential to develop an extensible approach to the hardware and software throughout the full quantum computing stack.

show abstract

Section: Higher Levelsmentioning

confidence: 99%

Rent’s rule and extensibility in quantum computing

Franke

Clarke

Vandersypen

et al. 2019

Microprocessors and Microsystems

View full text Add to dashboard Cite

show abstract

“…A construção de computadores quânticos enfrenta enormes problemas de engenharia para evitar erros quando o número de qubits aumenta [1]. Diversos laboratórios de mecânica quântica construíram computadores quânticos universais com poucos qubits.…”

Section: Origens E Novidades Da Computação Quânticaunclassified

“…Entre as principais aplicações no escopo destas máquinas podemos citar a simulação de sistemas quânticos, a simulação de química quântica, a solução de alguns problemas de otimização, a programação linear, a aprendizagem profunda quântica e a teoria de jogos quânticos [31]. Por exemplo, para simular o comportamento de uma molécula de cafeína, o computador clássico deve ter da ordem de 10 48 bits e o computador quântico da ordem de 160 qubits 1 . Infelizmente, aárea de algoritmos quânticos requer uma quantidade maior de qubits lógicos estáveis e com pouco ruído (mais de 1000 qubits já com correção de erros e tolerância a falhas).…”

Section: Origens E Novidades Da Computação Quânticaunclassified

Introdução à Programação de Computadores Quânticos

Portugal¹,

Marquezino²

2019

Jornada De Atualização Em Informática 2019

View full text Add to dashboard Cite

A computação quânticaé um novo paradigma computacional que explora o comportamento quântico para realizar um processamento mais eficiente do que o processamento baseado na lógica binária clássica. Este tutorial apresenta as bases da computação quântica de forma didática com foco no modelo de circuitos quânticos, usa o algoritmo de Grover como exemplo, descreve como implementar algoritmos quânticos e como programar computadores quânticos da IBM usando a interface gráfica IBM Q Experience e o kit de programação quântica Qiskit. Como pré-requisito,é necessário que o leitor tenha conhecimento básico deÁlgebra Linear e Python.

show abstract

“…The number of cables grows roughly linearly to the number of qubits. The footprint as well as the thermal conductance of the cables forms a challenge for a large number of qubits [12]. Addressing this issue, some research [13,14] investigates allocating the part of the electronics, such as waveform generators, in the 4 K environment.…”

Section: Potential Impactmentioning

confidence: 99%

A Microarchitecture for a Superconducting Quantum Processor

Rol

Bultink

et al. 2018

IEEE Micro

Self Cite

View full text Add to dashboard Cite

1 This paper proposed a quantum microarchitecture, QuMA, and a quantum microinstruction set, QuMIS, to bridge the gap between quantum software and hardware. Flexible programmability of a quantum processor is achieved by multilevel instructions decoding, abstracting analog control into digital control, and translating instruction execution with non-deterministic timing into event trigger with precise timing. QuMA and QuMIS are validated by several single-qubit experiments on a superconducting qubit.

show abstract

The engineering challenges in quantum computing

Cited by 78 publications

References 49 publications

Rent’s rule and extensibility in quantum computing

Rent’s rule and extensibility in quantum computing

Introdução à Programação de Computadores Quânticos

A Microarchitecture for a Superconducting Quantum Processor

Contact Info

Product

Resources

About