Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRelating Measurement Patterns to Circuits via Pauli Flow
63
0
0.0
(
0
)
Authors
Will Simmons
Ask ChatGPT about the research
No Arabic abstract
The one-way model of Measurement-Based Quantum Computing and the gate-based circuit model give two different presentations of how quantum computation can be performed. There are known methods for converting any gate-based quantum circuit into a one-way computation, whereas the reverse is only efficient given some constraints on the structure of the measurement pattern. Causal flow and generalised flow have already been shown as sufficient, with efficient algorithms for identifying these properties and performing the circuit extraction. Pauli flow is a weaker set of conditions that extends generalised flow to use the knowledge that some vertices are measured in a Pauli basis. In this paper, we show that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauli flow can be efficiently transformed into a gate-based circuit without using ancilla qubits. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus using a more circuit-like data structure we call the Pauli Dependency DAG.
rate research
Read More
We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabilizer states explicitly. These algorithms outperform previous noisy near-Clifford techniques for most circuits. We identify a large class of input states that can be efficiently simulated despite not being stabilizer states. The algorithms leverage probability distributions constructed from Bloch vectors, paralleling previously known algorithms that use the discrete Wigner function for qutrits.
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $log_2(3)$ binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla--a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qubit-only equivalent decomposition. This results in circuit cost reductions for important algorithms like quantum neurons and Grover search. We develop an open-source circuit simulator for qutrits, along with realistic near-term noise models which account for the cost of operating qutrits. Simulation results for these noise models indicate over 90% mean reliability (fidelity) for our circuit construction, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path towards scaling quantum computation.
Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the Population Recovery problem, we give an extremely simple algorithm that learns the Pauli error rates of an $n$-qubit channel to precision $epsilon$ in $ell_infty$ using just $O(1/epsilon^2) log(n/epsilon)$ applications of the channel. This is optimal up to the logarithmic factors. Our algorithm uses only unentangled state preparation and measurements, and the post-measurement classical runtime is just an $O(1/epsilon)$ factor larger than the measurement data size. It is also impervious to a limited model of measurement noise where heralded measurement failures occur independently with probability $le 1/4$. We then consider the case where the noise channel is close to the identity, meaning that the no-error outcome occurs with probability $1-eta$. In the regime of small $eta$ we extend our algorithm to achieve multiplicative precision $1 pm epsilon$ (i.e., additive precision $epsilon eta$) using just $Obigl(frac{1}{epsilon^2 eta}bigr) log(n/epsilon)$ applications of the channel.
A primary goal in recent research on contextuality has been to extend this concept to cases of inconsistent connectedness, where observables have different distributions in different contexts. This article proposes a solution within the framework of probabilistic causal models, which extend hidden-variables theories, and then demonstrates an equivalence to the contextuality-by-default (CbD) framework. CbD distinguishes contextuality from direct influences of context on observables, defining the latter purely in terms of probability distributions. Here we take a causal view of direct influences, defining direct influence within any causal model as the probability of all latent states of the system in which a change of context changes the outcome of a measurement. Model-based contextuality (M-contextuality) is then defined as the necessity of stronger direct influences to model a full system than when considered individually. For consistently connected systems, M-contextuality agrees with standard contextuality. For general systems, it is proved that M-contextuality is equivalent to the property that any model of a system must contain hidden influences, meaning direct influences that go in opposite directions for different latent states, or equivalently signaling between observers that carries no information. This criterion can be taken as formalizing the no-conspiracy principle that has been proposed in connection with CbD. M-contextuality is then proved to be equivalent to CbD-contextuality, thus providing a new interpretation of CbD-contextuality as the non-existence of a model for a system without hidden direct influences.
Competition between unitary dynamics that scrambles quantum information non-locally and local measurements that probe and collapse the quantum state can result in a measurement-induced entanglement phase transition. Here we study this phenomenon in an analytically tractable all-to-all Brownian hybrid circuit model composed of qubits. The system is initially entangled with an equal sized reference, and the subsequent hybrid system dynamics either partially preserves or totally destroys this entanglement depending on the measurement rate. Our approach can access a variety of entropic observables which are distinguished by the averaging procedure, and for concreteness we focus on a particular purity quantity for which the averaging is particularly simple. We represent the purity as a path integral coupling four replicas with twisted boundary conditions. Saddle-point analysis reveals a second-order phase transition corresponding to replica permutation symmetry breaking below a critical measurement rate. The transition is mean-field-like and we characterize the critical properties near the transition in terms of a simple Ising field theory in 0+1 dimensions. In addition to studying the purity of the entire system, we study subsystem purities and relate these results to manifestations of quantum error correction in the model. We also comment on the experimental feasibility for simulating this averaged purity, and corroborate our results with exact diagonalization for modest system sizes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
