The Computational Power of Non-interacting Particles
arXiv:1412.7637
Abstract
Shortened abstract: In this thesis, I study two restricted models of quantum computing related to free identical particles. Free fermions correspond to a set of two-qubit gates known as matchgates. Matchgates are classically simulable when acting on nearest neighbors on a path, but universal for quantum computing when acting on distant qubits or when SWAP gates are available. I generalize these results in two ways. First, I show that SWAP is only one in a large family of gates that uplift matchgates to quantum universality. In fact, I show that the set of all matchgates plus any nonmatchgate parity-preserving two-qubit gate is universal, and interpret this fact in terms of local invariants of two-qubit gates. Second, I investigate the power of matchgates in arbitrary connectivity graphs, showing they are universal on any connected graph other than a path or a cycle, and classically simulable on a cycle. I also prove the same dichotomy for the XY interaction. Free bosons give rise to a model known as BosonSampling. BosonSampling consists of (i) preparing a Fock state of n photons, (ii) interfering these photons in an m-mode linear interferometer, and (iii) measuring the output in the Fock basis. Sampling approximately from the resulting distribution should be classically hard, under reasonable complexity assumptions. Here I show that exact BosonSampling remains hard even if the linear-optical circuit has constant depth. I also report several experiments where three-photon interference was observed in integrated interferometers of various sizes, providing some of the first implementations of BosonSampling in this regime. The experiments also focus on the bosonic bunching behavior and on validation of BosonSampling devices. This thesis contains descriptions of the numerical analyses done on the experimental data, omitted from the corresponding publications.
arXiv commentPhD Thesis, defended at Universidade Federal Fluminense on March 2014. Final version, 208 pages. New results in Chapter 5 correspond to arXiv:1106.1863, arXiv:1207.2126, and arXiv:1308.1463. New results in Chapter 6 correspond to arXiv:1212.2783, arXiv:1305.3188, arXiv:1311.1622 and arXiv:1412.6788
References in corpus (63)
- Non-Abelian Anyons and Topological Quantum Computation
- Review article: Linear optical quantum computing
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with the Exchange Interaction
- On the Power of One Bit of Quantum Information
- Experimental demonstration of long-distance continuous-variable quantum key distribution
- Boson Sampling on a Photonic Chip
- Generation of Hyperentangled Photons Pairs
- Time Optimal Control in Spin Systems
- Experimental Boson Sampling
- Quantum teleportation using active feed-forward between two Canary Islands
- Experimental boson sampling in arbitrary integrated photonic circuits
- Optical quantum computation using cluster states
- Two-particle bosonic-fermionic quantum walk via 3D integrated photonics
- Quantum teleportation and entanglement distribution over 100-kilometre free-space channels
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Anderson localization of entangled photons in an integrated quantum walk
- Optimal Creation of Entanglement Using a Two--Qubit Gate
- On the Entangling Power of Quantum Evolutions
- A geometric theory of non-local two-qubit operations
- Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Classical simulation of noninteracting-fermion quantum circuits
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- Boson Sampling from Gaussian States
- A practical scheme for quantum computation with any two-qubit entangling gate
- On the experimental verification of quantum complexity in linear optics
- Multimode quantum interference of photons in multiport integrated devices
- Charge detection enables free-electron quantum computation
- Entangled Bell and GHZ states of excitons in coupled quantum dots
- Three-photon bosonic coalescence in an integrated tritter
- Deterministic linear optics quantum computation utilizing linked photon circuits
- Unified derivations of measurement-based schemes for quantum computation
- Universal quantum computation with little entanglement
- A Note on Linear Optics Gates by Post-Selection
- Indirect Interaction of Solid-State Qubits via Two-Dimensional Electron Gas
- Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling
- Scalable quantum computation via local control of only two qubits
- Error tolerance of the BosonSampling model for linear optics quantum computing
- General rules for bosonic bunching in multimode interferometers
- Ancilla-Driven Universal Quantum Computation
- Sufficient bound on the mode mismatch of single photons for scalability of the boson sampling computer
- Fermionic Linear Optics and Matchgates
- Permanents in linear optical networks
- Non-classical interference in integrated 3D multiports
- Exact gate-sequences for universal quantum computation using the XY-interaction alone
- Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing
- Super-stable tomography of any linear optical device
- Generation of Universal Linear Optics by Any Beamsplitter
- How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
- Boson-Sampling in the light of sample complexity
- A 2 rebit gate universal for quantum computing
- Measurement-based classical computation
- Extending matchgates into universal quantum computation
- Compressed quantum simulation of the Ising model
- Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations
- Encoded Universality for Generalized Anisotropic Exchange Hamiltonians
- Compressed Simulation of evolutions of the XY-model
- Anyons as quon particles
- Geometries for universal quantum computation with matchgates
- Quantum Computers: Noise Propagation and Adversarial Noise Models
- Universal quantum computation by the unitary control of ancilla qubits and using a fixed ancilla-register interaction
- The computational power of matchgates and the XY interaction on arbitrary graphs