quant-ph

Papers filed under quant-ph on arXiv, each one already summarized by Paperlayer. Open any of them to read the summary beside the original PDF, with every point linked to the line, figure, or table it came from.

Search paper metadata (including unsummarized papers)

661 to 720 of 3,289

1. Hybrid Programming for Near-term Quantum Computing Systems

   Alexander McCaskey, Eugene Dumitrescu, Dmitry Liakh +1

   quant-pharXiv:1805.09279v1·2018

2. Real Randomized Benchmarking

   A. K. Hashagen, S. T. Flammia, D. Gross +1

   quant-pharXiv:1801.06121v3·2018

3. Simulation of low-depth quantum circuits as complex undirected graphical models

   Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy +1

   quant-pharXiv:1712.05384v2·2017

4. Quantum state restoration and single-copy tomography

   Edward Farhi, David Gosset, Avinatan Hassidim +3

   quant-pharXiv:0912.3823v1·2009

5. Efficient optimization of the quantum relative entropy

   Hamza Fawzi, Omar Fawzi

   quant-phmath.OCarXiv:1705.06671v2·2017

6. Measurement-induced state transitions in a superconducting qubit: Beyond the rotating wave approximation

   Daniel Sank, Zijun Chen, Mostafa Khezri +21

   quant-pharXiv:1606.05721v2·2016

7. Multiqubit Clifford groups are unitary 3-designs

   Huangjun Zhu

   quant-phmath-phmath.MParXiv:1510.02619v2·2015

8. Characterizing Universal Gate Sets via Dihedral Benchmarking

   Arnaud Carignan-Dugas, Joel J. Wallman, Joseph Emerson

   quant-pharXiv:1508.06312v3·2015

9. Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map

   David Sutter, Marco Tomamichel, Aram W. Harrow

   quant-phmath-phmath.MParXiv:1507.00303v3·2015

10. Universal recovery map for approximate Markov chains

    David Sutter, Omar Fawzi, Renato Renner

    quant-phcs.ITmath-pharXiv:1504.07251v3·2015

11. The Fidelity of Recovery is Multiplicative

    Mario Berta, Marco Tomamichel

    quant-phcs.ITmath-pharXiv:1502.07973v2·2015

12. Squashed entanglement, k-extendibility, quantum Markov chains, and recovery maps

    Ke Li, Andreas Winter

    quant-phmath-phmath.MParXiv:1410.4184v4·2014

13. Quantum conditional mutual information and approximate Markov chains

    Omar Fawzi, Renato Renner

    quant-pharXiv:1410.0664v3·2014

14. Efficient Decoding of Topological Color Codes

    Pradeep Sarvepalli, Robert Raussendorf

    quant-pharXiv:1111.0831v1·2011

15. Efficient fault-tolerant decoding of topological color codes

    Ashley M. Stephens

    quant-pharXiv:1402.3037v1·2014

16. Pivoting makes the ZX-calculus complete for real stabilizers

    Ross Duncan, Simon Perdrix

    quant-phcs.LOarXiv:1307.7048v2·2013

17. The ZX-calculus is complete for stabilizer quantum mechanics

    Miriam Backens

    quant-pharXiv:1307.7025v1·2013

18. Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes

    Guillaume Duclos-Cianci, David Poulin

    quant-pharXiv:1304.6100v1·2013

19. Graphical algorithms and threshold error rates for the 2d colour code

    D. S. Wang, A. G. Fowler, C. D. Hill +1

    quant-pharXiv:0907.1708v1·2009

20. Boson-Sampling in the light of sample complexity

    C. Gogolin, M. Kliesch, L. Aolita +1

    quant-phcs.CCarXiv:1306.3995v3·2013

21. Optimal strategies for estimating the average fidelity of quantum gates

    Daniel M. Reich, Giulia Gualdi, Christiane P. Koch

    quant-pharXiv:1305.5649v2·2013

22. Almost one bit violation for the additivity of the minimum output entropy

    Serban T. Belinschi, Benoit Collins, Ion Nechita

    math-phmath.MPmath.OAarXiv:1305.1567v3·2013

23. QMA-complete problems

    Adam D. Bookatz

    quant-pharXiv:1212.6312v3·2012

24. Heralded state preparation in a superconducting qubit

    J. E. Johnson, C. Macklin, D. H. Slichter +4

    quant-phcond-mat.mes-hallcond-mat.supr-conarXiv:1202.5541v2·2012

25. The Smooth Entropy Formalism for von Neumann Algebras

    Mario Berta, Fabian Furrer, Volkher B. Scholz

    quant-phmath-phmath.MParXiv:1107.5460v3·2011

26. Universal Quantum Computation and Leakage Reduction in the 3-Qubit Decoherence Free Subsystem

    Bryan H. Fong, Stephen M. Wandzura

    quant-pharXiv:1102.2909v1·2011

27. Completeness of the ZH-calculus

    Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell +2

    quant-pharXiv:2103.06610v2·2021

28. The ZX&-calculus: A complete graphical calculus for classical circuits using spiders

    Cole Comfort

    cs.LOmath.CTquant-pharXiv:2004.05287v5·2020

29. An Algebraic Axiomatisation of ZX-calculus

    Quanlong Wang

    quant-pharXiv:1911.06752v3·2019

30. The rational fragment of the ZX-calculus

    Emmanuel Jeandel

    quant-phcs.LOarXiv:1810.05377v1·2018

31. Parallelizing quantum circuit synthesis

    Olivia Di Matteo, Michele Mosca

    quant-pharXiv:1606.07413v2·2016

32. The ZX-calculus is complete for the single-qubit Clifford+T group

    Miriam Backens

    quant-pharXiv:1412.8553v1·2014

33. Strong Complementarity and Non-locality in Categorical Quantum Mechanics

    Bob Coecke, Ross Duncan, Aleks Kissinger +1

    quant-phcs.LOmath.CTarXiv:1203.4988v2·2012

34. Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity

    Clara C. Wanjura, Florian Marquardt

    quant-phcond-mat.dis-nncs.ETarXiv:2406.06482v1·2024

35. Quantum Equilibrium Propagation: Gradient-Descent Training of Quantum Systems

    Benjamin Scellier

    quant-phcond-mat.dis-nncs.LGarXiv:2406.00879v1·2024

36. Beyond the Quantum

    Antony Valentini

    quant-phhep-thphysics.hist-pharXiv:1001.2758v1·2010

37. Optimal Quantum Sample Complexity of Learning Algorithms

    Srinivasan Arunachalam, Ronald de Wolf

    quant-phcs.CCcs.LGarXiv:1607.00932v3·2016

38. Quantum Pseudorandomness and Classical Complexity

    William Kretschmer

    quant-phcs.CCcs.CRarXiv:2103.09320v5·2021

39. Graph Homomorphisms for Quantum Players

    Laura Mančinska, David E. Roberson

    quant-phmath.COarXiv:1212.1724v2·2012

40. Experimental Quantum Fast Hitting on Hexagonal Graphs

    Hao Tang, Carlo Di Franco, Zi-Yu Shi +9

    quant-phphysics.opticsarXiv:1807.06625v2·2018

41. Distribution of entanglement in large-scale quantum networks

    S. Perseguers, G. J. Lapeyre Jr, D. Cavalcanti +2

    quant-pharXiv:1209.5303v3·2012

42. Gate-efficient simulation of molecular eigenstates on a quantum computer

    Marc Ganzhorn, Daniel J. Egger, Panagiotis Kl. Barkoutsos +8

    quant-pharXiv:1809.05057v1·2018

43. Building a Quantum Engineering Undergraduate Program

    Abraham Asfaw, Alexandre Blais, Kenneth R. Brown +34

    physics.ed-phquant-pharXiv:2108.01311v1·2021

44. Characterizing locally distinguishable orthogonal product states

    Yuan Feng, Yaoyun Shi

    quant-pharXiv:0707.3581v1·2007

45. Experimental quantum conference key agreement

    Massimiliano Proietti, Joseph Ho, Federico Grasselli +3

    quant-pharXiv:2002.01491v2·2020

46. Simulating 2D lattice gauge theories on a qudit quantum computer

    Michael Meth, Jan F. Haase, Jinglei Zhang +11

    quant-pharXiv:2310.12110v3·2023

47. A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver

    Aidan Pellow-Jarman, Ilya Sinayskiy, Anban Pillay +1

    quant-pharXiv:2106.08682v1·2021

48. The ZX calculus is a language for surface code lattice surgery

    Niel de Beaudrap, Dominic Horsman

    quant-phcs.LOarXiv:1704.08670v4·2017

49. Quantum digital signatures with quantum key distribution components

    Petros Wallden, Vedran Dunjko, Adrian Kent +1

    quant-pharXiv:1403.5551v2·2014

50. Benchmarking a quantum annealing processor with the time-to-target metric

    James King, Sheir Yarkoni, Mayssam M. Nevisi +2

    quant-pharXiv:1508.05087v1·2015

51. SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs

    Nicholas S. DiBrita, Jack Lange, Tirthak Patel

    quant-phcs.ETarXiv:2610.22275v1·2026

52. A comparative code study for quantum fault-tolerance

    Andrew W. Cross, David P. DiVincenzo, Barbara M. Terhal

    quant-pharXiv:0711.1556v2·2007

53. The Second Law of Quantum Complexity

    Adam R. Brown, Leonard Susskind

    hep-thgr-qcquant-pharXiv:1701.01107v2·2017

54. Reducing the Cost of Qudit State Preparation by Learning a Sparse Structure for SNAP Gates

    Marco Pennazio, Leonardo Ignazio Pagliochini, Riccardo Pellini +2

    quant-phcs.LGarXiv:2610.21557v1·2026

55. A Tutorial on Quantum Amplitude Embedding with Data Re-Uploading

    Hyojun Ahn, Joongheon Kim

    quant-phcs.AIcs.LGarXiv:2610.17836v1·2026

56. New directions in dynamical expectation estimation

    Panjin Kim, Kyung Chul Jeong, Yun-Tak Oh

    quant-phcs.ETarXiv:2609.18246v2·2026

57. Quantum Approximate Multi-Objective Optimization in Routing Problems

    Eduardo Willwock Lussi, Alisson dos Passos Fumaco, Marcos Vinicius Reballo +3

    cs.ETquant-pharXiv:2610.00168v1·2026

58. Towards Block-Level Fault-Tolerant Quantum Simulation on Small High-Rate Non-CSS Codes

    Zhuangzhuang Chen, Narayanan Rengaswamy

    quant-phcs.ITmath.ITarXiv:2609.16159v1·2026

59. Classical and Quantum Bounded Depth Approximation Algorithms

    M. B. Hastings

    quant-pharXiv:1905.07047v2·2019

60. Many-Body Quantum Zeno Effect and Measurement-Induced Subradiance Transition

    Alberto Biella, Marco Schiró

    quant-phcond-mat.stat-mecharXiv:2011.11620v3·2020