Architectural implications of quantum computing technologies

Meter, Rodney Van; Oskin, Mark

doi:10.1145/1126257.1126259

Cited by 84 publications

(84 citation statements)

References 112 publications

(148 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In quantum technologies with physical locations for qubits, gates are applied in fixed locations and "mobile" qubits may travel between locations. More detail is in [22]. 3 After arranging qubits, gates should be applied.…”

Section: Physical Layoutmentioning

confidence: 99%

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

Shafaei

Saeedi

Pedram

2013

Proceedings of the 50th Annual Design Automation Conference

104

View full text Add to dashboard Cite

Optimization of the interaction distance between qubits to map a quantum circuit into one-dimensional quantum architectures is addressed. The problem is formulated as the Minimum Linear Arrangement (MinLA) problem. To achieve this, an interaction graph is constructed for a given circuit, and multiple instances of the MinLA problem for selected subcircuits of the initial circuit are formulated and solved. In addition, a lookahead technique is applied to improve the cost of the proposed solution which examines different subcircuit candidates. Experiments on quantum circuits for quantum Fourier transform and reversible benchmarks show the effectiveness of the approach.

show abstract

Section: Physical Layoutmentioning

confidence: 99%

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

Shafaei

Saeedi

Pedram

2013

Proceedings of the 50th Annual Design Automation Conference

104

View full text Add to dashboard Cite

show abstract

“…the time a gate needs to perform its operation, may vary from one technology to another (see e.g. Table III of [16]), keeping the overall execution time as small as possible is essential in all these cases. Consequently, the depth metric can be applied in a generic manner, as it provides a proper model which can be considered already at the synthesis stage in the absence of precise technological constraints.…”

Section: Consideration Of Depth In Quantum Circuitsmentioning

confidence: 99%

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Abdessaied

Wille

Soeken

et al. 2013

Reversible Computation

View full text Add to dashboard Cite

Abstract. The synthesis of Boolean functions, as they are found in many quantum algorithms, is usually conducted in two steps. First, the function is realized in terms of a reversible circuit followed by a mapping into a corresponding quantum realization. During this process, the number of lines and the quantum costs of the resulting circuits have mainly been considered as optimization objectives thus far. However, beyond that also the depth of a quantum circuit is vital. Although first synthesis approaches that consider depth have recently been introduced, the majority of design methods did not consider this metric. In this paper, we introduce an optimization approach aiming for the reduction of depth in the process of mapping a reversible circuit into a quantum circuit. For this purpose, we present an improved (local) mapping of single gates as well as a (global) optimization scheme considering the whole circuit. In both cases, we incorporate the idea of exploiting additional circuit lines which are used in order to split a chain of serial gates. Our optimization techniques enable a concurrent application of gates which significantly reduces the depth of the circuit. Experiments show that reductions of approx. 40% on average can be achieved when following this scheme.

show abstract

“…Even in the face of Moore's Law, or the doubling in conventional computer power every year or two, the complexity of massively entangled quantum states of just a few hundred qubits can easily eclipse the capacity of classical information processing. 4 There are but a few known applications that exploit this quantum advantage, such as Shor's factoring algorithm, 5 and future quantum information processors will likely be applied to special-purpose applications. On the other hand, a quantum computer has not yet been built; therefore, new quantum applications and algorithms will likely follow from the evolution and capability of quantum hardware.…”

mentioning

confidence: 99%

Co-designing a scalable quantum computer with trapped atomic ions

2016

View full text Add to dashboard Cite

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 they are also fundamentally scalable to more powerful general purpose devices in future generations. This is because trapped ion qubits are atomic clock standards that can be made identical to a part in 10 15 , and their quantum circuit connectivity can be reconfigured through the use of external fields, without modifying the arrangement or architecture of the qubits themselves. In this forwardlooking overview, we show how a modular quantum computer with thousands or more qubits can be engineered from ion crystals, and how the linkage between ion trap qubits might be tailored to a variety of applications and quantum-computing protocols. Quantum information processors have the potential to perform computational tasks that are difficult or impossible using conventional modes of computing. 1-3 In a radical departure from classical information, the qubits of a quantum computer can simultaneously store bit values 0 and 1, and when measured they probabilistically assume definite states. Many interacting qubits, isolated from their environment, can represent huge amounts of information: there are exponentially many binary numbers that can co-exist, with entangled qubit correlations that can behave as invisible wires between the qubits. Even in the face of Moore's Law, or the doubling in conventional computer power every year or two, the complexity of massively entangled quantum states of just a few hundred qubits can easily eclipse the capacity of classical information processing. 4 There are but a few known applications that exploit this quantum advantage, such as Shor's factoring algorithm, 5 and future quantum information processors will likely be applied to special-purpose applications. On the other hand, a quantum computer has not yet been built; therefore, new quantum applications and algorithms will likely follow from the evolution and capability of quantum hardware.In the 20 years since the advent of Shor's algorithm 5 and the discovery of quantum error correction, 6-8 there has been remarkable progress in demonstrations of entangling quantum gates on o10 qubits in certain physical systems. Current efforts aim to scale to hundreds, thousands or even millions of interacting qubits. Unlike the classical scaling of bits and logic gates, however, large quantum systems are not comparable to the behaviour of just a few qubits. Just because 2 or 4 qubits can be completely controlled with negligible errors does not mean that this system can readily scale to 4100 qubits.In the last few years, two particular quantum hardware platforms have e...

show abstract

Architectural implications of quantum computing technologies

Cited by 84 publications

References 112 publications

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Co-designing a scalable quantum computer with trapped atomic ions

Contact Info

Product

Resources

About