arXiv subjects

Mile Gu

Publications and source records attributed to Mile Gu.

136 records · Page 8Linked to original sources

arXiv2009

Quantum Computing with Continuous-Variable Clusters

Continuous-variable cluster states offer a potentially promising method of implementing a quantum computer. This paper extends and further refines theoretical foundations and protocols for experimental implementation. We give a cluster-state implementation of the cubic phase gate through photon detection, which, together with homodyne detection, facilitates universal quantum computation. In addition, we characterize the offline squeezed resources required to generate an arbitrary graph state through passive linear optics. Most significantly, we prove that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster. Simple representations of continuous-variable graph states are introduced to analyze graph state transformations under measurement and the existence of universal continuous-variable resource states.

quant-ph↗

arXiv2008

More Really is Different

In 1972, P.W.Anderson suggested that `More is Different', meaning that complex physical systems may exhibit behavior that cannot be understood only in terms of the laws governing their microscopic constituents. We strengthen this claim by proving that many macroscopic observable properties of a simple class of physical systems (the infinite periodic Ising lattice) cannot in general be derived from a microscopic description. This provides evidence that emergent behavior occurs in such systems, and indicates that even if a `theory of everything' governing all microscopic interactions were discovered, the understanding of macroscopic order is likely to require additional insights.

cond-mat.other↗

arXiv2008

Quantum Control via Geometry: An explicit example

We explicitly compute the optimal cost for a class of example problems in geometric quantum control. These problems are defined by a Cartan decomposition of $su(2^n)$ into orthogonal subspaces $\mathfrak{l}$ and $\mathfrak{p}$ such that $[\mathfrak{l},\mathfrak{l}] \subseteq \mathfrak{p}, [\mathfrak{p},\mathfrak{l}] = \mathfrak{p}, [\mathfrak{p},\mathfrak{p}] \subseteq \mathfrak{l}$. Motion in the $\mathfrak{l}$ direction are assumed to have negligible cost, where motion in the $\mathfrak{p}$ direction do not. In the special case of two qubits, our results correspond to the minimal interaction cost of a given unitary.

quant-ph↗

arXiv2008

Gate complexity using Dynamic Programming

The relationship between efficient quantum gate synthesis and control theory has been a topic of interest in the quantum control literature. Motivated by this work, we describe in the present article how the dynamic programming technique from optimal control may be used for the optimal synthesis of quantum circuits. We demonstrate simulation results on an example system on SU(2), to obtain plots related to the gate complexity and sample paths for different logic gates.

quant-ph↗

arXiv2007

Coherent State Distinguishability in Continuous Variable Quantum Cryptography

We use the probability of error as a measure of distinguishability between two pure and two mixed symmetric coherent states in the context of continuous variable quantum cryptography. We show that the two mixed symmetric coherent states (in which the various components have the same real part) never give an eavesdropper more information than two pure coherent states.

quant-ph↗

arXiv2006

Building Gaussian Cluster States by Linear Optics

The linear optical creation of Gaussian cluster states, a potential resource for universal quantum computation, is investigated. We show that for any Gaussian cluster state, the canonical generation scheme in terms of QND-type interactions, can be entirely replaced by off-line squeezers and beam splitters. Moreover, we find that, in terms of squeezing resources, the canonical states are rather wasteful and we propose a systematic way to create cheaper states. As an application, we consider Gaussian cluster computation in multiple-rail encoding. This encoding may reduce errors due to finite squeezing, even when the extra rails are achieved through off-line squeezing and linear optics.

quant-ph↗

arXiv2006

Universal Quantum Computation with Continuous-Variable Cluster States

We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multi-mode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.

quant-ph↗

arXiv2006

Optimal control, geometry, and quantum computing

We prove upper and lower bounds relating the quantum gate complexity of a unitary operation, U, to the optimal control cost associated to the synthesis of U. These bounds apply for any optimal control problem, and can be used to show that the quantum gate complexity is essentially equivalent to the optimal control cost for a wide range of problems, including time-optimal control and finding minimal distances on certain Riemannian, subriemannian, and Finslerian manifolds. These results generalize the results of Nielsen, Dowling, Gu, and Doherty, Science 311, 1133-1135 (2006), which showed that the gate complexity can be related to distances on a Riemannian manifold

quant-ph↗

arXiv2006

Quantum Computation as Geometry

Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms, or to prove limitations on the power of quantum computers.

quant-ph↗

arXiv2003

Unconditional preparation of entanglement between atoms in cascaded optical cavities

We propose a scheme to unconditionally entangle the internal states of atoms trapped in separate high finesse optical cavities. The scheme uses the technique of quantum reservoir engineering in a cascaded cavity QED setting, and for ideal (lossless) coupling between the cavities generates an entangled pure state. Highly entangled states are also shown to be possible for realizable cavity QED parameters and with nonideal coupling.

quant-ph↗