activity
19942023
most citedMixed State Entanglement and Quantum Error Correction

5.3k citations · 25.9k across the 91 of their papers we have counts for

collaborators
Showing quant-phShow all

87 papers · 1 filter

quant-ph2023★ 17 cited

Quantification of Entanglement and Coherence with Purity Detection

Ting Zhang, Graeme Smith, John A. Smolin +7

Entanglement and coherence are fundamental properties of quantum systems, promising to power near future quantum technologies, such as quantum computation, quantum communication an…

quant-ph2023★ 3 cited

Optimal one-shot entanglement sharing

Vikesh Siddhu, John Smolin

Sharing entanglement across quantum interconnects is fundamental for quantum information processing. We discuss a practical setting where this interconnect, modeled by a quantum ch…

quant-ph2022★ 14 cited

The platypus of the quantum channel zoo

Felix Leditzky, Debbie Leung, Vikesh Siddhu +2

Understanding quantum channels and the strange behavior of their capacities is a key objective of quantum information theory. Here we study a remarkably simple, low-dimensional, si…

quant-ph2022★ 24 cited

Generic nonadditivity of quantum capacity in simple channels

Felix Leditzky, Debbie Leung, Vikesh Siddhu +2

Determining capacities of quantum channels is a fundamental question in quantum information theory. Despite having rigorous coding theorems quantifying the flow of information acro…

quant-ph2021★ 13 cited

Active Learning of Quantum System Hamiltonians yields Query Advantage

Arkopal Dutt, Edwin Pednault, Chai Wah Wu +4

Hamiltonian learning is an important procedure in quantum system identification, calibration, and successful operation of quantum computers. Through queries to the quantum system,…

quant-ph2021

Hardware-efficient random circuits to classify noise in a multi-qubit system

Jin-Sung Kim, Lev S. Bishop, Antonio D. Corcoles +3

In this work we extend a multi-qubit benchmarking technique known as the Binned Output Generation (BOG) in order to discriminate between coherent and incoherent noise sources in th…

quant-ph2021★ 251 cited

OpenQASM 3: A broader and deeper quantum assembly language

Andrew W. Cross, Ali Javadi-Abhari, Thomas Alexander +8

Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was p…

quant-ph2021★ 7 cited

Private learning implies quantum stability

Srinivasan Arunachalam, Yihui Quek, John Smolin

Learning an unknown -qubit quantum state is a fundamental challenge in quantum computing. Information-theoretically, it is known that tomography requires exponential in …

quant-ph2020★ 3 cited

Denoising quantum states with Quantum Autoencoders -- Theory and Applications

Tom Achache, Lior Horesh, John Smolin

We implement a Quantum Autoencoder (QAE) as a quantum circuit capable of correcting Greenberger-Horne-Zeilinger (GHZ) states subject to various noisy quantum channels : the bit-fli…

quant-ph2020★ 211 cited

Laser-annealing Josephson junctions for yielding scaled-up superconducting quantum processors

Jared B. Hertzberg, Eric J. Zhang, Sami Rosenblatt +8

As superconducting quantum circuits scale to larger sizes, the problem of frequency crowding proves a formidable task. Here we present a solution for this problem in fixed-frequenc…

quant-ph2018

A compressed classical description of quantum states

David Gosset, John Smolin

We show how to approximately represent a quantum state using the square root of the usual amount of classical memory. The classical representation of an -qubit state consist…

quant-ph2017★ 156 cited

Three Qubit Randomized Benchmarking

David C. McKay, Sarah Sheldon, John A. Smolin +2

As quantum circuits increase in size, it is critical to establish scalable multiqubit fidelity metrics. Here we investigate three-qubit randomized benchmarking (RB) with fixed-freq…

quant-ph2017★ 659 cited

Quantum optimization using variational algorithms on near-term quantum devices

Nikolaj Moll, Panagiotis Barkoutsos, Lev S. Bishop +15

Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits.…

quant-ph2017★ 7 cited

Quantifying Coherence and Entanglement via Simple Measurements

Graeme Smith, John A. Smolin, Xiao Yuan +3

Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental dete…

quant-ph2017

Open Quantum Assembly Language

Andrew W. Cross, Lev S. Bishop, John A. Smolin +1

This document describes a quantum assembly language (QASM) called OpenQASM that is used to implement experiments with low depth quantum circuits. OpenQASM represents universal phys…

quant-ph2015★ 181 cited

Demonstration of quantum advantage in machine learning

D. Ristè, Marcus P. da Silva, Colm A. Ryan +5

The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advant…

quant-ph2015★ 84 cited

Scalable randomized benchmarking of non-Clifford gates

Andrew W. Cross, Easwar Magesan, Lev S. Bishop +2

Randomized benchmarking is a widely used experimental technique to characterize the average error of quantum operations. Benchmarking procedures that scale to enable characterizati…

quant-ph2015★ 302 cited

Trading classical and quantum computational resources

Sergey Bravyi, Graeme Smith, John Smolin

We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. Firs…

quant-ph2014★ 82 cited

Quantum learning robust to noise

Andrew W. Cross, Graeme Smith, John A. Smolin

Noise is often regarded as anathema to quantum computation, but in some settings it can be an unlikely ally. We consider the problem of learning the class of -bit parity functio…

quant-ph2014★ 72 cited

How to efficiently select an arbitrary Clifford group element

Robert Koenig, John A. Smolin

We give an algorithm which produces a unique element of the Clifford group on qubits from an integer (the number of elements in the g…

quant-ph2014★ 16 cited

Comment on "Distinguishing Classical and Quantum Models for the D-Wave Device"

Seung Woo Shin, Graeme Smith, John A. Smolin +1

The SSSV model is a simple classical model that achieves excellent correlation with published experimental data on the D-Wave machine's behavior on random instances of its native p…

quant-ph2014★ 89 cited

How "Quantum" is the D-Wave Machine?

Seung Woo Shin, Graeme Smith, John A. Smolin +1

Recently there has been intense interest in claims about the performance of the D-Wave machine. In this paper, we outline a simple classical model, and show that it achieves excell…

quant-ph2013★ 19 cited

Maximal Privacy Without Coherence

Debbie Leung, Ke Li, Graeme Smith +1

Privacy lies at the fundament of quantum mechanics. A coherently transmitted quantum state is inherently private. Remarkably, coherent quantum communication is not a prerequisite f…

quant-ph2013★ 283 cited

Implementing a strand of a scalable fault-tolerant quantum computing fabric

Jerry M. Chow, Jay M. Gambetta, Easwar Magesan +7

Quantum error correction (QEC) is an essential step towards realising scalable quantum computers. Theoretically, it is possible to achieve arbitrarily long protection of quantum in…