Measurement-Based Quantum Computation
- URL: http://arxiv.org/abs/2109.10111v1
- Date: Tue, 21 Sep 2021 11:45:02 GMT
- Title: Measurement-Based Quantum Computation
- Authors: Tzu-Chieh Wei
- Abstract summary: Measurement-based quantum computation is a framework of quantum computation.
It originates from the one-way quantum computer of Raussendorf and Briegel.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Measurement-based quantum computation is a framework of quantum computation,
where entanglement is used as a resource and local measurements on qubits are
used to drive the computation. It originates from the one-way quantum computer
of Raussendorf and Briegel, who introduced the so-called cluster state as the
underlying entangled resource state and showed that any quantum circuit could
be executed by performing only local measurement on individual qubits. The
randomness in the measurement outcomes can be dealt with by adapting future
measurement axes so that computation is deterministic. Subsequent works have
expanded the discussions of the measurement-based quantum computation to
various subjects, including the quantification of entanglement for such a
measurement-based scheme, the search for other resource states beyond cluster
states and computational phases of matter. In addition, the measurement-based
framework also provides useful connections to the emergence of time ordering,
computational complexity and classical spin models, blind quantum computation,
etc. and has given an alternative, resource-efficient approach to implement the
original linear-optic quantum computation of Knill, Laflamme and Milburn.
Cluster states and a few other resource states have been created experimentally
in various physical systems and the measurement-based approach offers a
potential alternative to the standard circuit approach to realize a practical
quantum computer.
Related papers
- Effect of the readout efficiency of quantum measurement on the system entanglement [44.99833362998488]
We quantify the entanglement for a particle on a 1d quantum random walk under inefficient monitoring.
We find that the system's maximal mean entanglement at the measurement-induced quantum-to-classical crossover is in different ways by the measurement strength and inefficiency.
arXiv Detail & Related papers (2024-02-29T18:10:05Z) - Practical Benchmarking of Randomized Measurement Methods for Quantum
Chemistry Hamiltonians [2.031936330777447]
hybrid quantum-classical algorithms for the application of ground state energy estimation in quantum chemistry involve estimating the expectation value of a molecular Hamiltonian with respect to a quantum state through measurements on a quantum device.
We propose a benchmark that assesses the performance of these methods against a set of common molecular Hamiltonians and common states encountered during the runtime of hybrid quantum-classical algorithms.
In experiments on IBM quantum devices against small molecules, we observe that decision diagrams reduces the number of measurements made by classical shadows by more than 80%, that made by locally biased classical shadows by around 57%, and consistently require fewer quantum measurements along with lower classical
arXiv Detail & Related papers (2023-12-12T18:29:55Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Single Qubit State Estimation on NISQ Devices with Limited Resources and
SIC-POVMs [0.0]
We consider the problem of estimating the quantum state of a qubit in a quantum processing unit without conducting direct measurements of it.
We implement and test the circuit using the quantum computer of the Technical Research Centre of Finland as well as an IBM quantum computer.
arXiv Detail & Related papers (2023-08-15T09:27:52Z) - Determining the ability for universal quantum computing: Testing
controllability via dimensional expressivity [39.58317527488534]
Controllability tests can be used in the design of quantum devices to reduce the number of external controls.
We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
arXiv Detail & Related papers (2023-08-01T15:33:41Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Advancing Hybrid Quantum-Classical Computation with Real-Time Execution [10.818632836746668]
We describe a next-generation implementation of classical computation embedded within quantum programs.
It enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits.
arXiv Detail & Related papers (2022-06-26T19:50:15Z) - Quantum spin systems for measurement-based quantum computation [0.0]
Measurement-based quantum computation is different from other approaches for quantum computation, in that everything needs to be done is only local measurement on a certain entangled state.
We give a pedagogical treatment on the basics, and then review some selected developments beyond graph states, including Affleck-Kennedy-Lieb-Tasaki states and more recent 2D symmetry-protected topological states.
arXiv Detail & Related papers (2021-09-21T11:36:06Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z) - Correlations for computation and computation for correlations [0.0]
We connect quantum correlations with computation using 4-photon Greenberger-Horne-Zeilinger (GHZ) states.
We show how the generated states can be used to specifically compute Boolean functions.
The connection between quantum correlation and computability shown here has applications in quantum technologies.
arXiv Detail & Related papers (2020-05-04T18:33:13Z)
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.