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.Comment: 13 Pages, 1 Figur

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.Comment: 5 Pages, 3 figure

Entangled-state cycles from conditional quantum evolution

A system of cascaded qubits interacting via the oneway exchange of photons is studied. While for general operating conditions the system evolves to a superposition of Bell states (a dark state) in the long-time limit, under a particular resonance condition no steady state is reached within a finite time. We analyze the conditional quantum evolution (quantum trajectories) to characterize the asymptotic behavior under this resonance condition. A distinct bimodality is observed: for perfect qubit coupling, the system either evolves to a maximally entangled Bell state without emitting photons (the dark state), or executes a sustained entangled-state cycle - random switching between a pair of Bell states while emitting a continuous photon stream; for imperfect coupling, two entangled-state cycles coexist, between which a random selection is made from one quantum trajectory to another.Comment: 12 pages, 10 figure

Ipteks Sistem Informasi Akuntansi dalam Aktivitas Pencairan Dana pada Kantor Wilayah Kementerian Agama Provinsi Sulawesi Utara

The system is a series of two or more interconnected components, which is interact to achieve a goal. This study aims to determine the role of accounting information systems in disbursing funds in the Regional Office of the Ministry of Religion of North Sulawesi Province. The method used in this writing is qualitative descriptive. The results of this study can be seen that the importance of accounting information systems for the Regional Office of the Ministry of Religion of North Sulawesi Province. With the existence of a good Accounting Information System, companies can carry out operations and information processes more effectively and efficiently because of the controls that control these processes so that the results achieved can be in accordance with the objectives of the agency

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.Comment: 17 pages, 5 figure

Entanglement-free certification of entangling gates

Not all quantum protocols require entanglement to outperform their classical alternatives. The nonclassical correlations that lead to this quantum advantage are conjectured to be captured by quantum discord. Here we demonstrate that discord can be explicitly used as a resource: certifying untrusted entangling gates without generating entanglement at any stage. We implement our protocol in the single-photon regime, and show its success in the presence of high levels of noise and imperfect gate operations. Our technique offers a practical method for benchmarking entangling gates in physical architectures in which only highly-mixed states are available.Comment: 5 pages, 2 figure

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.Comment: 4 pages, no figure

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 manifoldComment: 7 Pages Added Full Names to Author

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 (2n) into orthogonal subspaces l and p such that [l,l] p, [p,l] =p, [p,p] l. Motion in the l direction is assumed to have negligible cost, where motion in the p direction does not. In the special case of two qubits, our results correspond to the minimal interaction cost of a given unitary