scholarly journals Experimental comparison of two quantum computing architectures

2017 ◽  
Vol 114 (13) ◽  
pp. 3305-3310 ◽  
Author(s):  
Norbert M. Linke ◽  
Dmitri Maslov ◽  
Martin Roetteler ◽  
Shantanu Debnath ◽  
Caroline Figgatt ◽  
...  
Keyword(s):  
State Of The Art ◽  
Quantum Algorithms ◽  
Quantum Systems ◽  
Experimental Comparison ◽  
Quantum Computers ◽  
Physical Systems ◽  
Technology Platforms ◽  
Fully Connected ◽  
Identical Quantum ◽  
Selection Of

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www.research.ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

scholarly journals The NISQ Analyzer: Automating the Selection of Quantum Computers for Quantum Algorithms

2020 ◽  
pp. 66-85
Author(s):  
Marie Salm ◽  
Johanna Barzen ◽  
Uwe Breitenbücher ◽  
Frank Leymann ◽  
Benjamin Weder ◽  
...  
Keyword(s):  
Quantum Algorithms ◽  
Quantum Computers ◽  
Selection Of

scholarly journals Nearly tight Trotterization of interacting electrons

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 495
Author(s):  
Yuan Su ◽  
Hsin-Yuan Huang ◽  
Earl T. Campbell
Keyword(s):  
Electronic Structure ◽  
Plane Wave ◽  
Hubbard Model ◽  
Transition Amplitude ◽  
Quantum Systems ◽  
Quantum Computers ◽  
Initial State ◽  
Physical Systems ◽  
Interacting Electrons ◽  
Simulation Error

We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity of the target Hamiltonian, sparsity of interactions, and prior knowledge of the initial state. We achieve this using Trotterization for a class of interacting electrons that encompasses various physical systems, including the plane-wave-basis electronic structure and the Fermi-Hubbard model. We estimate the simulation error by taking the transition amplitude of nested commutators of the Hamiltonian terms within the η-electron manifold. We develop multiple techniques for bounding the transition amplitude and expectation of general fermionic operators, which may be of independent interest. We show that it suffices to use (n5/3η2/3+n4/3η2/3)no(1) gates to simulate electronic structure in the plane-wave basis with n spin orbitals and η electrons, improving the best previous result in second quantization up to a negligible factor while outperforming the first-quantized simulation when n=η2−o(1). We also obtain an improvement for simulating the Fermi-Hubbard model. We construct concrete examples for which our bounds are almost saturated, giving a nearly tight Trotterization of interacting electrons.

scholarly journals Fisher Information in Noisy Intermediate-Scale Quantum Applications

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 539
Author(s):  
Johannes Jakob Meyer
Keyword(s):  
Fisher Information ◽  
Quantum Algorithms ◽  
Quantum Fisher Information ◽  
Quantum Systems ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Quantum Devices ◽  
Intermediate Scale ◽  
Quantum Sensing ◽  
Near Term

The recent advent of noisy intermediate-scale quantum devices, especially near-term quantum computers, has sparked extensive research efforts concerned with their possible applications. At the forefront of the considered approaches are variational methods that use parametrized quantum circuits. The classical and quantum Fisher information are firmly rooted in the field of quantum sensing and have proven to be versatile tools to study such parametrized quantum systems. Their utility in the study of other applications of noisy intermediate-scale quantum devices, however, has only been discovered recently. Hoping to stimulate more such applications, this article aims to further popularize classical and quantum Fisher information as useful tools for near-term applications beyond quantum sensing. We start with a tutorial that builds an intuitive understanding of classical and quantum Fisher information and outlines how both quantities can be calculated on near-term devices. We also elucidate their relationship and how they are influenced by noise processes. Next, we give an overview of the core results of the quantum sensing literature and proceed to a comprehensive review of recent applications in variational quantum algorithms and quantum machine learning.

scholarly journals Resource-efficient quantum algorithm for protein folding

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Anton Robert ◽  
Panagiotis Kl. Barkoutsos ◽  
Stefan Woerner ◽  
Ivano Tavernelli
Keyword(s):  
Protein Folding ◽  
Amino Acid ◽  
Fault Tolerant ◽  
State Of The Art ◽  
Quantum Algorithms ◽  
Coarse Grained ◽  
Evolutionary Strategies ◽  
Dimensional Structure ◽  
Quantum Computers ◽  
Small Proteins

AbstractPredicting the three-dimensional structure of a protein from its primary sequence of amino acids is known as the protein folding problem. Due to the central role of proteins’ structures in chemistry, biology and medicine applications, this subject has been intensively studied for over half a century. Although classical algorithms provide practical solutions for the sampling of the conformation space of small proteins, they cannot tackle the intrinsic NP-hard complexity of the problem, even when reduced to the simplest Hydrophobic-Polar model. On the other hand, while fault-tolerant quantum computers are beyond reach for state-of-the-art quantum technologies, there is evidence that quantum algorithms can be successfully used in noisy state-of-the-art quantum computers to accelerate energy optimization in frustrated systems. In this work, we present a model Hamiltonian with $${\mathcal{O}}({N}^{4})$$ O ( N 4 ) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with N monomers on a lattice. The model reflects many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models. In addition, we use a robust and versatile optimization scheme, bringing together variational quantum algorithms specifically adapted to classical cost functions and evolutionary strategies to simulate the folding of the 10 amino acid Angiotensin on 22 qubits. The same method is also successfully applied to the study of the folding of a 7 amino acid neuropeptide using 9 qubits on an IBM 20-qubit quantum computer. Bringing together recent advances in building gate-based quantum computers with noise-tolerant hybrid quantum-classical algorithms, this work paves the way towards accessible and relevant scientific experiments on real quantum processors.

NMR quantum computing - lessons for the future

2001 ◽  
Vol 1 (Special) ◽  
pp. 134-142
Author(s):  
L. Vandersypen ◽  
I. Chuang
Keyword(s):  
Nuclear Magnetic Resonance ◽  
Quantum Computing ◽  
Magnetic Resonance ◽  
Large Scale ◽  
Experimental Methods ◽  
Quantum Systems ◽  
Quantum Computers ◽  
Physical Systems ◽  
The Future ◽  
Nuclear Magnetic

Future physical implementations of large-scale quantum computers will face significant practical challenges. Many useful lessons can be drawn from present results with Nuclear Magnetic Resonance realizations of controllable two, three, five, and seven qubit quantum systems. We summarize various experimental methods and theoretical procedures learned in this work which will be of considerable value in building and testing quantum processors with a wide variety of physical systems.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

scholarly journals Practical Security of RSA Against NTC-Architecture Quantum Computing Attacks

2021 ◽  
Author(s):  
Kai Li ◽  
Qing-yu Cai
Keyword(s):  
Quantum Computing ◽  
Ion Trap ◽  
Quantum Algorithms ◽  
Coherence Time ◽  
Quantum Computers ◽  
Quantum Time ◽  
Speed Up ◽  
Key Length ◽  
Concurrent Architecture ◽  
Qubit Gate

AbstractQuantum algorithms can greatly speed up computation in solving some classical problems, while the computational power of quantum computers should also be restricted by laws of physics. Due to quantum time-energy uncertainty relation, there is a lower limit of the evolution time for a given quantum operation, and therefore the time complexity must be considered when the number of serial quantum operations is particularly large. When the key length is about at the level of KB (encryption and decryption can be completed in a few minutes by using standard programs), it will take at least 50-100 years for NTC (Neighbor-only, Two-qubit gate, Concurrent) architecture ion-trap quantum computers to execute Shor’s algorithm. For NTC architecture superconducting quantum computers with a code distance 27 for error-correcting, when the key length increased to 16 KB, the cracking time will also increase to 100 years that far exceeds the coherence time. This shows the robustness of the updated RSA against practical quantum computing attacks.

scholarly journals Fundamental limitations on distillation of quantum channel resources

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Bartosz Regula ◽  
Ryuji Takagi
Keyword(s):  
Lower Bounds ◽  
Quantum Channel ◽  
Quantum Communication ◽  
Fault Tolerant ◽  
State Of The Art ◽  
Quantum Systems ◽  
Noisy Channels ◽  
General Transformation ◽  
Fundamental Limitations ◽  
Strong Converse

AbstractQuantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels, expressed in the form of no-go theorems and quantitative bounds for the manipulation of general quantum channel resources under the most general transformation protocols. Focusing on the class of distillation tasks — which can be understood either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels — we develop fundamental restrictions on the error incurred in such transformations, and comprehensive lower bounds for the overhead of any distillation protocol. In the asymptotic setting, our results yield broadly applicable bounds for rates of distillation. We demonstrate our results through applications to fault-tolerant quantum computation, where we obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication, where we recover a number of strong converse bounds for quantum channel capacity.

scholarly journals State of the Art in Open Platforms for Collaborative Urban Design and Sharing of Resources in Districts and Cities

2021 ◽  
Vol 13 (9) ◽  
pp. 4875
Author(s):  
Barry Hayes ◽  
Dorota Kamrowska-Zaluska ◽  
Aleksandar Petrovski ◽  
Cristina Jiménez-Pulido
Keyword(s):  
Urban Design ◽  
Local Community ◽  
State Of The Art ◽  
Sharing Economy ◽  
Peer To Peer ◽  
Urban Environments ◽  
The State ◽  
Smart Technology ◽  
Technological Advances ◽  
Technology Platforms

This work discusses recent developments in sharing economy concepts and collaborative co-design technology platforms applied in districts and cities. These developments are being driven both by new technological advances and by increased environmental awareness. The paper begins by outlining the state of the art in smart technology platforms for collaborative urban design, highlighting a number of recent examples. The case of peer-to-peer trading platforms applied in the energy sector is then used to illustrate how sharing economy concepts and their enabling technologies can accelerate efforts towards more sustainable urban environments. It was found that smart technology platforms can encourage peer-to-peer and collaborative activity, and may have a profound influence on the future development of cities. Many of the research and development projects in this area to date have focused on demonstrations at the building, neighbourhood, and local community scales. Scaling these sharing economy platforms up to the city scale and beyond has the potential to provide a number of positive environment impacts. However, significant technical and regulatory barriers to wider implementation exist, and realising this potential will require radical new approaches to the ownership and governance of urban infrastructure. This paper provides a concise overview of the state of the art in this emerging field, with the aim of identifying the most promising areas for further research.

Interpreting testing and assessment: A state-of-the-art review

2021 ◽  
pp. 026553222110361
Author(s):  
Chao Han
Keyword(s):  
State Of The Art ◽  
Professional Certification ◽  
Automatic Assessment ◽  
Prospective Students ◽  
Assessment Practice ◽  
High Stakes ◽  
Future Directions ◽  
Assessment Tasks ◽  
Interpreter Education ◽  
Selection Of

Over the past decade, testing and assessing spoken-language interpreting has garnered an increasing amount of attention from stakeholders in interpreter education, professional certification, and interpreting research. This is because in these fields assessment results provide a critical evidential basis for high-stakes decisions, such as the selection of prospective students, the certification of interpreters, and the confirmation/refutation of research hypotheses. However, few reviews exist providing a comprehensive mapping of relevant practice and research. The present article therefore aims to offer a state-of-the-art review, summarizing the existing literature and discovering potential lacunae. In particular, the article first provides an overview of interpreting ability/competence and relevant research, followed by main testing and assessment practice (e.g., assessment tasks, assessment criteria, scoring methods, specificities of scoring operationalization), with a focus on operational diversity and psychometric properties. Second, the review describes a limited yet steadily growing body of empirical research that examines rater-mediated interpreting assessment, and casts light on automatic assessment as an emerging research topic. Third, the review discusses epistemological, psychometric, and practical challenges facing interpreting testers. Finally, it identifies future directions that could address the challenges arising from fast-changing pedagogical, educational, and professional landscapes.

Sign in / Sign up

Export Citation Format

Share Document