Quantum Theory from Principles, Quantum Software from Diagrams

• URL: http://arxiv.org/abs/2101.03608v1
• Date: Sun, 10 Jan 2021 19:17:05 GMT
• Title: Quantum Theory from Principles, Quantum Software from Diagrams
• Authors: John van de Wetering
• Abstract summary: The first part is about how quantum theory can be recovered from first principles. The second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical problems in quantum computing.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical problems in quantum computing. The main results of the first part include a reconstruction of quantum theory from principles related to properties of sequential measurement and a reconstruction based on properties of pure maps and the mathematics of effectus theory. It also includes a detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra motivated by von Neumann algebras. In the second part we find a new model for measurement-based quantum computing, study how measurement patterns in the one-way model can be simplified and find a new algorithm for extracting a unitary circuit from such patterns. We use these results to develop a circuit optimisation strategy that leads to a new normal form for Clifford circuits and reductions in the T-count of Clifford+T circuits.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation [0.0]
  Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves exponential speedups (polynomial runtime) over existing simulators. The findings may have implications for quantum algorithm design, error correction, and the development of more efficient quantum simulators.
  arXiv  Detail & Related papers  (2024-07-28T20:02:21Z)
• Direct Probe of Topology and Geometry of Quantum States on IBM Q [2.7801206308522417]
  We show that a density matrix form of the quantum geometric tensor (QGT) can be explicitly re-constructed from Pauli operator measurements on a quantum circuit. We propose two algorithms, suitable for IBM quantum computers, to directly probe QGT. Explicit results obtained from IBM Q a Chern insulator model are presented and analysed.
  arXiv  Detail & Related papers  (2024-03-21T09:18:16Z)
• Lecture Notes on Quantum Electrical Circuits [49.86749884231445]
  Theory of quantum electrical circuits goes under the name of circuit quantum electrodynamics or circuit-QED. The goal of the theory is to provide a quantum description of the most relevant degrees of freedom. These lecture notes aim at giving a pedagogical overview of this subject for theoretically-oriented Master or PhD students in physics and electrical engineering.
  arXiv  Detail & Related papers  (2023-12-08T19:26:34Z)
• A Bottom-up Approach to Constructing Symmetric Variational Quantum Circuits [0.0]
  We show how to construct symmetric quantum circuits using representation theory. We show how to derive the particle-conserving exchange gates, which are commonly used in constructing hardware-efficient quantum circuits.
  arXiv  Detail & Related papers  (2023-08-17T10:57:15Z)
• The Expressivity of Classical and Quantum Neural Networks on Entanglement Entropy [0.3299672391663526]
  Von Neumann entropy from R'enyi entropies is a challenging problem in quantum field theory. We propose a general framework to tackle this problem using classical and quantum neural networks with supervised learning. Our proposed methods can accurately predict the von Neumann and R'enyi entropies numerically.
  arXiv  Detail & Related papers  (2023-05-01T18:00:01Z)
• Overcoming exponential volume scaling in quantum simulations of lattice gauge theories [1.5675763601034223]
  We present a formulation of a compact U(1) gauge theory in 2+1 dimensions free of gauge redundancies. A naive implementation onto a quantum circuit has a gate count that scales exponentially with the volume. We discuss how to break this exponential scaling by performing an operator redefinition that reduces the non-locality of the Hamiltonian.
  arXiv  Detail & Related papers  (2022-12-09T01:18:46Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• A Complete Equational Theory for Quantum Circuits [58.720142291102135]
  We introduce the first complete equational theory for quantum circuits. Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
  arXiv  Detail & Related papers  (2022-06-21T17:56:31Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.