75,128 research outputs found
Graphical Structures for Design and Verification of Quantum Error Correction
We introduce a high-level graphical framework for designing and analysing
quantum error correcting codes, centred on what we term the coherent parity
check (CPC). The graphical formulation is based on the diagrammatic tools of
the zx-calculus of quantum observables. The resulting framework leads to a
construction for stabilizer codes that allows us to design and verify a broad
range of quantum codes based on classical ones, and that gives a means of
discovering large classes of codes using both analytical and numerical methods.
We focus in particular on the smaller codes that will be the first used by
near-term devices. We show how CSS codes form a subset of CPC codes and, more
generally, how to compute stabilizers for a CPC code. As an explicit example of
this framework, we give a method for turning almost any pair of classical
[n,k,3] codes into a [[2n - k + 2, k, 3]] CPC code. Further, we give a simple
technique for machine search which yields thousands of potential codes, and
demonstrate its operation for distance 3 and 5 codes. Finally, we use the
graphical tools to demonstrate how Clifford computation can be performed within
CPC codes. As our framework gives a new tool for constructing small- to
medium-sized codes with relatively high code rates, it provides a new source
for codes that could be suitable for emerging devices, while its zx-calculus
foundations enable natural integration of error correction with graphical
compiler toolchains. It also provides a powerful framework for reasoning about
all stabilizer quantum error correction codes of any size.Comment: Computer code associated with this paper may be found at
https://doi.org/10.15128/r1bn999672
Quantum computing programming languages
In this Thesis we analyze the quantum software developed by IBM and Google, respectively Qiskit and Cirq. It is reviewed how to program a simple quantum algorithm on both software and they are compared. In order to test their performance, we implement a circuit to verify particular N-qubit entangled states, called GHZ states, in both software. In fact, one of the main goal of quantum computation, and of quantum science in general, is the creation of a highly entangled state of many particles, because entangled states are the cornerstone of quantum speedups. We quantify the goodness of the state created through fidelity measurements. These provide a fundamental criterion for the comparison of two quantum states. We test the quantum circuit on the cloud service made available by IBM. In Cirq, no cloud service is yet available, therefore we test that circuit adding quantum noise channels, in order to reproduce and study noise effects in a model of real hardware
BQP-completeness of Scattering in Scalar Quantum Field Theory
Recent work has shown that quantum computers can compute scattering
probabilities in massive quantum field theories, with a run time that is
polynomial in the number of particles, their energy, and the desired precision.
Here we study a closely related quantum field-theoretical problem: estimating
the vacuum-to-vacuum transition amplitude, in the presence of
spacetime-dependent classical sources, for a massive scalar field theory in
(1+1) dimensions. We show that this problem is BQP-hard; in other words, its
solution enables one to solve any problem that is solvable in polynomial time
by a quantum computer. Hence, the vacuum-to-vacuum amplitude cannot be
accurately estimated by any efficient classical algorithm, even if the field
theory is very weakly coupled, unless BQP=BPP. Furthermore, the corresponding
decision problem can be solved by a quantum computer in a time scaling
polynomially with the number of bits needed to specify the classical source
fields, and this problem is therefore BQP-complete. Our construction can be
regarded as an idealized architecture for a universal quantum computer in a
laboratory system described by massive phi^4 theory coupled to classical
spacetime-dependent sources.Comment: 41 pages, 7 figures. Corrected typo in foote
Verification of Many-Qubit States
Verification is a task to check whether a given quantum state is close to an
ideal state or not. In this paper, we show that a variety of many-qubit quantum
states can be verified with only sequential single-qubit measurements of Pauli
operators. First, we introduce a protocol for verifying ground states of
Hamiltonians. We next explain how to verify quantum states generated by a
certain class of quantum circuits. We finally propose an adaptive test of
stabilizers that enables the verification of all polynomial-time-generated
hypergraph states, which include output states of the
Bremner-Montanaro-Shepherd-type instantaneous quantum polynomial time (IQP)
circuits. Importantly, we do not make any assumption that the identically and
independently distributed copies of the same states are given: Our protocols
work even if some highly complicated entanglement is created among copies in
any artificial way. As applications, we consider the verification of the
quantum computational supremacy demonstration with IQP models, and verifiable
blind quantum computing.Comment: 15 pages, 3 figures, published versio
- …