arXiv subjects

Yaakov S. Weinstein

Publications and source records attributed to Yaakov S. Weinstein.

At least 37 records · Page 2Linked to original sources

arXiv2009

Entanglement Sudden Death as an Indicator of Fidelity in a Four-Qubit Cluster State

I explore the entanglement evolution of a four qubit cluster state in a dephasing environment concentrating on the phenomenon of entanglement sudden death (ESD). Specifically, I ask whether the onset of ESD has an effect on the utilization of this cluster state as a means of implementing a single qubit rotation in the measurement based cluster state model of quantum computation. To do this I compare the evolution of the entanglement to the fidelity, a measure of how accurately the desired state (after the measurement based operations) is achieved. I find that ESD does not cause a change of behavior or discontinuity in the fidelity but may indicate when the fidelity of certain states goes to .5.

quant-ph↗

arXiv2008

Tri-partite Entanglement Witnesses and Sudden Death

I explore entanglement dynamics in a three qubit system comparing the ability of entanglement witnesses to detect tri-partite entanglement to the phenomenon of entanglement sudden death (ESD). Using a system subject to dephasing I invoke entanglement witnesses to detect tri-partite GHZ and W-type entanglement and compare the evolution of their detection capabilites with the evolution of the negativity, bi-partite concurrence, and tri-partite negativity. Interestingly, I find a state in which there is no concurrence or tri-partite negativity but there is entanglement. Finally, I utilize a three qubit quantum error correction (QEC) code to address how ESD affects the abilities of quantum error correction.

quant-ph↗

arXiv2008

Parameters of Pseudo-Random Quantum Circuits

Pseudorandom circuits generate quantum states and unitary operators which are approximately distributed according to the unitarily invariant Haar measure. We explore how several design parameters affect the efficiency of pseudo-random circuits, with the goal of identifying relevant trade-offs and optimizing convergence. The parameters we explore include the choice of single- and two-qubit gates, the topology of the underlying physical qubit architecture, the probabilistic application of two-qubit gates, as well as circuit size, initialization, and the effect of control constraints. Building on the equivalence between pseudo-random circuits and approximate $t$-designs, a Markov matrix approach is employed to analyze asymptotic convergence properties of pseudo-random second-order moments to a 2-design. Quantitative results on the convergence rate as a function of the circuit size are presented for qubit topologies with a sufficient degree of symmetry. Our results may be theoretically and practically useful to optimize the efficiency of random state and operator generation.

quant-ph↗

arXiv2008

Quantum pseudo-randomness from cluster-state quantum computation

We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for optimizing pseudo-random circuits by properly choosing single-qubit rotations. A Markov chain analysis provides the tool for analyzing convergence rates to the Haar measure and finding the optimal single-qubit gate distribution. Our results may be viewed as an alternative construction of approximate unitary 2-designs.

quant-ph↗

arXiv2008

A Universal Operator Theoretic Framework for Quantum Fault Tolerance

In this paper we introduce a universal operator theoretic framework for quantum fault tolerance. This incorporates a top-down approach that implements a system-level criterion based on specification of the full system dynamics, applied at every level of error correction concatenation. This leads to more accurate determinations of error thresholds than could previously be obtained. This is demonstrated both formally and with an explicit numerical example. The basis for our approach is the Quantum Computer Condition (QCC), an inequality governing the evolution of a quantum computer. We show that all known coding schemes are actually special cases of the QCC. We demonstrate this by introducing a new, operator theoretic form of entanglement assisted quantum error correction, which incorporates as special cases all known error correcting protocols, and is itself a special case of the QCC.

quant-ph↗

arXiv2007

Signatures of incoherence in a quantum information processor

Incoherent noise is manifest in measurements of expectation values when the underlying ensemble evolves under a classical distribution of unitary processes. While many incoherent processes appear decoherent, there are important differences. The distribution functions underlying incoherent processes are either static or slowly varying with respect to control operations and so the errors introduced by these distributions are refocusable. The observation and control of incoherence in small Hilbert spaces is well known. Here we explore incoherence during an entangling operation, such as is relevant in quantum information processing. As expected, it is more difficult to separate incoherence and decoherence over such processes. However, by studying the fidelity decay under a cyclic entangling map we are able to identify distinctive experimental signatures of incoherence. This result is demonstrated both through numerical simulations and experimentally in a three qubit nuclear magnetic resonance implementation.

quant-ph↗

arXiv2007

Reliable Final Computational Results from Faulty Quantum Computation

In this paper we extend both standard fault tolerance theory and Kitaev's model for quantum computation, combining them so as to yield quantitative results that reveal the interplay between the two. Our analysis establishes a methodology that allows us to quantitatively determine design parameters for a quantum computer, the values of which ensure that an overall computation of interest yields a correct *final result* with some prescribed probability of success, as opposed to merely ensuring that the desired *final quantum state* is obtained. As a specific example of the practical application of our approach, we explicitly calculate the number of levels of error correction concatenation needed to achieve a correct final result for the overall computation with some prescribed success probability. Since our methodology allows one to determine parameters required in order to achieve the correct final result for the overall quantum computation, as opposed to merely ensuring that the desired final quantum state is produced, our method enables the determination of complete quantum computational resource requirements associated to the actual solution of practical problems.

quant-ph↗

arXiv2006

Generalized Entanglement as a Natural Framework for Exploring Quantum Chaos

We demonstrate that generalized entanglement [Barnum {\em et al.}, Phys. Rev. A {\bf 68}, 032308 (2003)] provides a natural and reliable indicator of quantum chaotic behavior. Since generalized entanglement depends directly on a choice of preferred observables, exploring how generalized entanglement increases under dynamical evolution is possible without invoking an auxiliary coupled system or decomposing the system into arbitrary subsystems. We find that, in the chaotic regime, the long-time saturation value of generalized entanglement agrees with random matrix theory predictions. For our system, we provide physical intuition into generalized entanglement within a single system by invoking the notion of extent of a state. The latter, in turn, is related to other signatures of quantum chaos.

quant-ph↗

arXiv2006

A Scalable Architecture for Coherence-Preserving Qubits

We propose scalable architectures for the coherence-preserving qubits introduced by Bacon, Brown, and Whaley [Phys. Rev. Lett. {\bf 87}, 247902 (2001)]. These architectures employ extra qubits providing additional degrees of freedom to the system. We show that these extra degrees of freedom can be used to counter errors in coupling strength within the coherence-preserving qubit and to combat interactions with environmental qubits. The presented architectures incorporate experimentally viable methods for inter-logical-qubit coupling and can implement a controlled phase gate via three simultaneous Heisenberg exchange operations. The extra qubits also provide flexibility in the arrangement of the physical qubits. Specifically, all physical qubits of a coherent-preserving qubit lattice can be placed in two spatial dimensions. Such an arrangement allows for universal cluster state computation.

quant-ph↗

arXiv2005

Efficient Construction of Photonic Quantum Computational Clusters

We demonstrate a method of creating photonic two-dimensional cluster states that is considerably more efficient than previously proposed approaches. Our method uses only local unitaries and type-I fusion operations. The increased efficiency of our method compared to previously proposed constructions is obtained by identifying and exploiting local equivalence properties inherent in cluster states.

quant-ph↗

arXiv2005

Quantum Computer Condition: Stability, Classical Computation and Norms

The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of fluctuations and systematic errors in the values of characteristic parameters in realistic systems. We show that fault-tolerant quantum computation is possible despite variations in these parameters. We also use the QCC to explicitly show that reliable classical computation can be carried out using as input the results of fault-tolerant, but imperfect, quantum computation. Finally, we consider the advantages and disadvantages of the superoperator and diamond norms in connection with application of the QCC to various quantum information-theoretic problems.

quant-ph↗

arXiv2005

Comment on "Operator Quantum Error Correction"

The attempt to equate operator quantum error correction (quant-ph/0504189v1) with the quantum computer condition (quant-ph/0507141) in version two of quant-ph/0504189 is shown to be invalid.

quant-ph↗

arXiv2005

Entanglement Generation of Nearly-Random Operators

We study the entanglement generation of operators whose statistical properties approach those of random matrices but are restricted in some way. These include interpolating ensemble matrices, where the interval of the independent random parameters are restricted, pseudo-random operators, where there are far fewer random parameters than required for random matrices, and quantum chaotic evolution. Restricting randomness in different ways allows us to probe connections between entanglement and randomness. We comment on which properties affect entanglement generation and discuss ways of efficiently producing random states on a quantum computer.

quant-ph↗

arXiv2005

Matrix Element Distribution as a Signature of Entanglement Generation

We explore connections between an operator's matrix element distribution and its entanglement generation. Operators with matrix element distributions similar to those of random matrices generate states of high multi-partite entanglement. This occurs even when other statistical properties of the operators do not conincide with random matrices. Similarly, operators with some statistical properties of random matrices may not exhibit random matrix element distributions and will not produce states with high levels of multi-partite entanglement. Finally, we show that operators with similar matrix element distributions generate similar amounts of entanglement.

quant-ph↗

arXiv2005

Quantum Dot Cluster State Computing with Encoded Qubits

A class of architectures is advanced for cluster state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to the supercoherent qubits introduced by Bacon, Brown, and Whaley [Phys. Rev. Lett. {\bf 87}, 247902 (2001)] for which we discuss the effects of various errors, and present means of error protection.

quant-ph↗

arXiv2005

The Effects of Symmetries on Quantum Fidelity Decay

We explore the effect of a system's symmetries on fidelity decay behavior. Chaos-like exponential fidelity decay behavior occurs in non-chaotic systems when the system possesses symmetries and the applied perturbation is not tied to a classical parameter. Similar systems without symmetries exhibit faster-than-exponential decay under the same type of perturbation. This counter-intuitive result, that extra symmetries cause the system to behave in a chaotic fashion, may have important ramifications for quantum error correction.

quant-ph↗

arXiv2004

Pseudo-random operators of the circular ensembles

We demonstrate quantum algorithms to implement pseudo-random operators that closely reproduce statistical properties of random matrices from the three universal classes: unitary, symmetric, and symplectic. Modified versions of the algorithms are introduced for the less experimentally challenging quantum cellular automata. For implementing pseudo-random symplectic operators we provide gate sequences for the unitary part of the time-reversal operator.

quant-ph↗

arXiv2004

Quantum Fidelity Decay of Quasi-Integrable Systems

We show, via numerical simulations, that the fidelity decay behavior of quasi-integrable systems is strongly dependent on the location of the initial coherent state with respect to the underlying classical phase space. In parallel to classical fidelity, the quantum fidelity generally exhibits Gaussian decay when the perturbation affects the frequency of periodic phase space orbits and power-law decay when the perturbation changes the shape of the orbits. For both behaviors the decay rate also depends on initial state location. The spectrum of the initial states in the eigenbasis of the system reflects the different fidelity decay behaviors. In addition, states with initial Gaussian decay exhibit a stage of exponential decay for strong perturbations. This elicits a surprising phenomenon: a strong perturbation can induce a higher fidelity than a weak perturbation of the same type.

quant-ph↗