Experimental Demonstration of a Quantum Circuit using Linear Optics Gates

One of the main advantages of an optical approach to quantum computing is the fact that optical fibers can be used to connect the logic and memory devices to form useful circuits, in analogy with the wires of a conventional computer. Here we describe an experimental demonstration of a simple quantum circuit of that kind in which two probabilistic exclusive-OR (XOR) logic gates were combined to calculate the parity of three input qubits.Comment: v2 is final PRA versio

An Algebraic Approach to Linear-Optical Schemes for Deterministic Quantum Computing

Linear-Optical Passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the algebraic structure of LOP transformations and quantum computing. We first show how to decompose the Fock space of N optical modes in finite-dimensional subspaces that are suitable for encoding strings of qubits and invariant under LOP transformations (these subspaces are related to the spaces of irreducible unitary representations of U(N)). Next we show how to design in algorithmic fashion LOP circuits which implement any quantum circuit deterministically. We also present some simple examples, such as the circuits implementing a CNOT gate and a Bell-State Generator/Analyzer.Comment: new version with minor modification

Benchmarking gate-based quantum computers

With the advent of public access to small gate-based quantum processors, it becomes necessary to develop a benchmarking methodology such that independent researchers can validate the operation of these processors. We explore the usefulness of a number of simple quantum circuits as benchmarks for gate-based quantum computing devices and show that circuits performing identity operations are very simple, scalable and sensitive to gate errors and are therefore very well suited for this task. We illustrate the procedure by presenting benchmark results for the IBM Quantum Experience, a cloud-based platform for gate-based quantum computing.Comment: Accepted for publication in Computer Physics Communication

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore it is in the second level of the Fourier hierarchy. We show that output probability distributions of the HC1Q model cannot be classically efficiently sampled within a multiplicative error unless the polynomial-time hierarchy collapses to the second level. The proof technique is different from those used for previous sub-universal models, such as IQP, Boson Sampling, and DQC1, and therefore the technique itself might be useful for finding other sub-universal models that are hard to classically simulate. We also study the classical verification of quantum computing in the second level of the Fourier hierarchy. To this end, we define a promise problem, which we call the probability distribution distinguishability with maximum norm (PDD-Max). It is a promise problem to decide whether output probability distributions of two quantum circuits are far apart or close. We show that PDD-Max is BQP-complete, but if the two circuits are restricted to some types in the second level of the Fourier hierarchy, such as the HC1Q model or the IQP model, PDD-Max has a Merlin-Arthur system with quantum polynomial-time Merlin and classical probabilistic polynomial-time Arthur.Comment: 30 pages, 4 figure

Fluxon readout of a superconducting qubit

Quantum computing using superconducting circuits underwent rapid development in the last decade. This field has propelled from quantum manipulation of single two-level systems to complex designs employing multiple coupled qubits allowing one to execute simple quantum algorithms. On the way to a practical quantum computer, a need for scalable interfaces between classical circuits and the quantum counterparts has arisen. Low-temperature superconducting single-flux quantum (SFQ) logic employs magnetic fluxons in Josephson transmission lines (JTLs) as basic bits for classical computation. Here, we report on an experiment implementing a direct link between SFQ electronics and a superconducting qubit. We demonstrate a readout of the state of a flux qubit through a frequency shift of a single fluxon oscillating in a JTL. The energy spectrum of the flux qubit is measured using this technique. The demonstrated approach may open ways to future full-scale integration of solid-state quantum computers with digital SFQ electronics

Computing motion using analog VLSI vision chips: An experimental comparison among different approaches

We have designed, built and tested a number of analog CMOS VLSI circuits for computing 1-D motion from the time-varying intensity values provided by an array of on-chip phototransistors. We present experimental data for two such circuits and discuss their relative performance. One circuit approximates the correlation model while a second chip uses resistive grids to compute zero-crossings to be tracked over time by a separate digital processor. Both circuits integrate image acquisition with image processing functions and compute velocity in real time. For comparison, we also describe the performance of a simple motion algorithm using off-the-shelf digital components. We conclude that analog circuits implementing various correlation-like motion algorithms are more robust than our previous analog circuits implementing gradient-like motion algorithms