Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputational power of matchgates with supplementary resources
155
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the classical simulation complexity in both the weak and strong senses, of matchgate (MG) computations supplemented with all combinations of settings involving inclusion of intermediate adaptive or nonadaptive computational basis measurements, product state or magic and general entangled state inputs, and single- or multi-line outputs. We find a striking parallel to known results for Clifford circuits, after some rebranding of resources. We also give bounds on the amount of classical simulation effort required in case of limited access intermediate measurements and entangled inputs. In further settings we show that adaptive MG circuits remain classically efficiently simulable if arbitrary two-qubit entangled input states on consecutive lines are allowed, but become quantum universal for three or more lines. And if adaptive measurements in non-computational bases are allowed, even with just computational basis inputs, we get quantum universal power again.
rate research
Read More
We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First we consider sparse quantum circuits such that each qubit participates in O(1) two-qubit gates. It is shown that any sparse circuit on n+k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Secondly, we study Pauli-based computation (PBC) where allowed operations are non-destructive eigenvalue measurements of n-qubit Pauli operators. The computation begins by initializing each qubit in the so-called magic state. This model is known to be equivalent to the universal quantum computer. We show that any PBC on n+k qubits can be simulated by PBCs on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Finally, we propose a purely classical algorithm that can simulate a PBC on n qubits in a time $2^{c n} poly(n)$ where $capprox 0.94$. This improves upon the brute-force simulation method which takes time $2^n poly(n)$. Our algorithm exploits the fact that n-fold tensor products of magic states admit a low-rank decomposition into n-qubit stabilizer states.
We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). We show that, for a wide range of SPT phases, the computational power of ground states is uniform throughout each phase. This computational power, defined as the Lie group of executable gates in MBQC, is determined by the same algebraic information that labels the SPT phase itself. We prove that these Lie groups always contain a full set of single-qubit gates, thereby affirming the long-standing conjecture that general SPT phases can serve as computationally useful phases of matter.
We investigate the usefulness of ground states of quantum spin chains with symmetry-protected topological order (SPTO) for measurement-based quantum computation. We show that, in spatial dimension one, if an SPTO phase supports quantum wire, then, subject to an additional symmetry condition that is satisfied in all cases so far investigated, it can also be used for quantum computation.
The projected entangled pair state (PEPS) representation of quantum states on two-dimensional lattices induces an entanglement based hierarchy in state space. We show that the lowest levels of this hierarchy exhibit an enormously rich structure including states with critical and topological properties as well as resonating valence bond states. We prove, in particular, that coheren
With the goal of gaining a deeper understanding of quantum non-locality, we decompose quantum correlations into more elementary non-local correlations. We show that the correlations of all pure entangled states of two qubits can be simulated without communication, hence using only non-signaling resources. Our simulation model works in two steps. First, we decompose the quantum correlations into a local and a non-local part. Second, we present a model for simulating the nonlocal part using only non-signaling resources. In our model partially entangled states require more nonlocal resources than maximally entangled states, but the less the state is entangled, the less frequently must the nonlocal resources be used.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
