1.1k citations
- Ames Research CenterUS122 papers
- Universities Space Research AssociationUS34 papers
- Fermi National Accelerator LaboratoryUS15 papers
- Massachusetts Institute of TechnologyUS15 papers
- Google (United States)US14 papers
- University of Colorado BoulderUS14 papers
- KBR (United States)US13 papers
- Princeton UniversityUS11 papers
- Stinger Ghaffarian Technologies (United States)US11 papers
- University of California, BerkeleyUS10 papers
- Center for Astrophysics Harvard & SmithsonianUS9 papers
- Centre National de la Recherche ScientifiqueFR9 papers
17 papers · 2 filters
A class of Bell diagonal entanglement witnesses in : optimization and the spanning property
Anindita Bera, Filip A. Wudarski, Gniewomir Sarbicki +1
Two classes of Bell diagonal indecomposable entanglement witnesses in are considered. Within the first class, we find a generalization of the we…
Dual Map Framework for Noise Characterization of Quantum Computers
James Sud, Jeffrey Marshall, Zhihui Wang +2
In order to understand the capabilities and limitations of quantum computers, it is necessary to develop methods that efficiently characterize and benchmark error channels present…
Exploring Quantum Average-Case Distances: proofs, properties, and examples
Filip B. Maciejewski, Zbigniew Puchała, Michał Oszmaniec
In this work, we perform an in-depth study of recently introduced average-case quantum distances. The average-case distances approximate the average Total-Variation (TV) distance b…
Operational Quantum Average-Case Distances
Filip B. Maciejewski, Zbigniew Puchała, Michał Oszmaniec
We introduce distance measures between quantum states, measurements, and channels based on their statistical distinguishability in generic experiments. Specifically, we analyze the…
Surface code compilation via edge-disjoint paths
Michael Beverland, Vadym Kliuchnikov, Eddie Schoute
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor lo…
Bounds on approximating Max XOR with quantum and classical local algorithms
Kunal Marwaha, Stuart Hadfield
We consider the power of local algorithms for approximately solving Max XOR, a generalization of two constraint satisfaction problems previously studied with classical and quant…