Exponential Advantage Research Articles

Quantum Generative Adversarial Learning.

Generative adversarial networks represent a powerful tool for classical machine learning: a generator tries to create statistics for data that mimics those of a true data set, while a discriminator tries to discriminate between the true and fake data. The learning process for generator and discriminator can be thought of as an adversarial game, and under reasonable assumptions, the game converges to the point where the generator generates the same statistics as the true data and the discriminator is unable to discriminate between the true and the generated data. This Letter introduces the notion of quantum generative adversarial networks, where the data consist either of quantum states or of classical data, and the generator and discriminator are equipped with quantum information processors. We show that the unique fixed point of the quantum adversarial game also occurs when the generator produces the same statistics as the data. Neither the generator nor the discriminator perform quantum tomography; linear programing drives them to the optimal. Since quantum systems are intrinsically probabilistic, the proof of the quantum case is different from-and simpler than-the classical case. We show that, when the data consist of samples of measurements made on high-dimensional spaces, quantum adversarial networks may exhibit an exponential advantage over classical adversarial networks.

Anticoncentration theorems for schemes showing a quantum speedup

One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum computers, a state of affairs dubbed quantum speedup, or sometimes "quantum computational supremacy". The known schemes heavily rely on mathematical assumptions that are plausible but unproven, prominently results on anticoncentration of random prescriptions. In this work, we aim at closing the gap by proving two anticoncentration theorems and accompanying hardness results, one for circuit-based schemes, the other for quantum quench-type schemes for quantum simulations. Compared to the few other known such results, these results give rise to a number of comparably simple, physically meaningful and resource-economical schemes showing a quantum speedup in one and two spatial dimensions. At the heart of the analysis are tools of unitary designs and random circuits that allow us to conclude that universal random circuits anticoncentrate as well as an embedding of known circuit-based schemes in a 2D translation-invariant architecture.

Detecting metrologically useful asymmetry and entanglement by a few local measurements

Important properties of a quantum system are not directly measurable, but they can be disclosed by how fast the system changes under controlled perturbations. In particular, asymmetry and entanglement can be verified by reconstructing the state of a quantum system. Yet, this usually requires experimental and computational resources which increase exponentially with the system size. Here we show how to detect metrologically useful asymmetry and entanglement by a limited number of measurements. This is achieved by studying how they affect the speed of evolution of a system under a unitary transformation. We show that the speed of multiqubit systems can be evaluated by measuring a set of local observables, providing exponential advantage with respect to state tomography. Indeed, the presented method requires neither the knowledge of the state and the parameter-encoding Hamiltonian nor global measurements performed on all the constituent subsystems. We implement the detection scheme in an all-optical experiment.

Entanglement and deterministic quantum computing with one qubit

The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about entanglement and quantum correlations in dynamical systems where the quantum states are mixed and the eigenvalue spectrum is highly degenerate. We apply these results to the Deterministic quantum computing with one qubit (DQC1) computation model and show that the states generated in a DQC1 circuit have an eigenvalue structure that makes them difficult to entangle, even when they are relatively far from the completely mixed state. Our results strengthen the conjecture that it may be possible to find quantum algorithms that do not generate entanglement and yet still have an exponential advantage over their classical counterparts.

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative

This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the solution is required to be silent (i.e., when the state of each process remains fixed from some point in time during any execution), there exists a lower bound of \(\varOmega (\log n)\) bits of memory per participating node , where n denotes the number of nodes in the system. This lower bound holds even in rings. We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only \(O(\log \log n)\) memory bits per node, and stabilizes in \(O(n\log ^2 n)\) rounds. Our protocol has several attractive features that make it suitable for practical purposes. First, it assumes an execution model that is used by existing compilers for real networks. Second, the size of the ring (or any upper bound on this size) does not need to be known by any node. Third, the node identifiers can be of various sizes. Finally, no synchrony assumption, besides weak fairness, is assumed. Our result shows that, perhaps surprisingly, silence can be traded for an exponential decrease in memory space without significantly increasing stabilization time or introducing restrictive assumptions.

A different Deutsch–Jozsa

One of the early achievements of quantum computing was demonstrated by Deutsch and Jozsa (Proc R Soc Lond A Math Phys Sci 439(1907):553, 1992) regarding classification of a particular type of Boolean functions. Their solution demonstrated an exponential speedup compared to classical approaches to the same problem; however, their solution was the only known quantum algorithm for that specific problem so far. This paper demonstrates another quantum algorithm for the same problem, with the same exponential advantage compared to classical algorithms. The novelty of this algorithm is the use of quantum amplitude amplification, a technique that is the key component of another celebrated quantum algorithm developed by Grover (Proceedings of the twenty-eighth annual ACM symposium on theory of computing, ACM Press, New York, 1996). A lower bound for randomized (classical) algorithms is also presented which establishes a sound gap between the effectiveness of our quantum algorithm and that of any randomized algorithm with similar efficiency.

Time-optimized quantum QFT gate in an Ising coupling system

Quantum Fourier transform (QFT) is a quantum analogue of the classical discrete Fourier transform. It is a fundamental quantum gate in quantum algorithms which has an exponential advantage over the classical computation and has been excessively studied. Normally, an n-qubit quantum Fourier transform could be resolved into the tensor product of n single-qubit operations, and each operation could be implemented by a Hadamard gate and a controlled phase gate. Then the complexity of an n-qubit QFT is of order O(n2). To reduce the complexity of quantum operations, optimal control (OC) method has recently been used successfully to find the minimum time for implementing a quantum operation. Up to now, two types of quantum optimal control methods have been presented, i.e. analytical and numerical methods. The analytical approach is to change the problem of efficient synthesis of unitary transformations into the geometrical one of finding the shortest paths. Numerical optimal control procedures are based on the gradient methods (GRAPE, Gradient Ascent Pulse Engineering) and Krotov methods. Notable application mainly focus on nuclear magnetic resonance fields, including imaging, liquid-state NMR, solid-state NMR, and NMR quantum computation. One obvious advantage of optimal control NMR quantum computation is that the OC unitary evolution transformation pulse sequences are normally shorter than the conventional corresponding ones. Here we use the optimal control method to find the minimum duration for implementing QFT quantum gate. A linear spin chain with nearest-neighbor Ising interaction is used to find the optimization. And the optimized pulse sequence is experimentally demonstrated on an NMR quantum information processor. By using optimal control method with numerical calculation, a three-qubit QFT in an indirect-linear-coupling chain system is optimized. The duration of the OC QFT is obviously shorter than that of conventional approaches. The OC pulse sequence has been experimentally implemented on a liquid-state NMR spectrometer. To verify the optimally controlled pulse sequence for the three-qubit QFT, different initial states are assumed. The accuracy of the OC pulse sequence could be demonstrated by the consistency of theoretical simulation spectra with the experimental results. The good consistency between the simulation and the experimental spectra demonstrates that the OC QFT is of high fidelity.

Observation of Quantum Interference as a Function of Berry’s Phase in a Complex Hadamard Optical Network

Emerging models of quantum computation driven by multiphoton quantum interference, while not universal, may offer an exponential advantage over classical computers for certain problems. Implementing these circuits via geometric phase gates could mitigate requirements for error correction to achieve fault tolerance while retaining their relative physical simplicity. We report an experiment in which a geometric phase is embedded in an optical network with no closed loops, enabling quantum interference between two photons as a function of the phase.

Lipoabdominoplasty: An exponential advantage for a consistently safe and aesthetic outcome

Background:Extensive liposuction along with limited dissection of abdominal flaps is slowly emerging as a well proven advantageous method over standard abdominoplasty.Materials and Methods:A retrospective study analyzed 146 patients managed for the abdominal contour deformities from March 2004 to February 2010. A simple method to project the post operative outcome by rotation of a supine lateral photograph to upright posture in 46 patients prospectively has succeeded in projecting a predictable result. All patients were encouraged to practice chest physiotherapy in ‘tummy tuck’ position during the preoperative counseling. Aggressive liposuction of entire upper abdomen, a limited dissection in the midline, plication of diastasis of rectus whenever indicated, panniculectomy and neoumblicoplasty were done in all patients.Results:The patients had a mean age of 43, youngest being 29 and oldest 72 years. Majority were of normal weight (94%). Twelve were morbidly obese; 57 patients had undergone previous abdominal surgeries; 49 patients had associated hernias. Lipoabdominoplasty yielded a satisfactory result in 110 (94%) patients. The postoperative patient had a definitely less heavy harmonious abdomen with improved waistline. The complications were more with higher BMI, fat thickness of more than 7 cm and prolonged operating time when other procedures were combined.Conclusions:Extensive liposuction combined with limited dissection method applied to all abdominoplasty patients yielded consistently safe, reliable and predictable aesthetic results with less complications and faster recovery. The simple photographic manipulation has helped project the postoperative outcome reliably. The preoperative chest physiotherapy in tummytuck position helped prevent chest complications.

Simulation of classical thermal states on a quantum computer: A transfer-matrix approach

We present a hybrid quantum-classical algorithm to simulate thermal states of classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one at a time. We identified a class of classical models for which our method is efficient and avoids potential exponential overheads encountered by Grover-like or quantum Metropolis schemes. Our algorithm also gives an exponential advantage for two-dimensional Ising models with magnetic field on a square lattice, compared with the previously known Zalka's algorithm.

Improved constructions of quantum automata

We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use 4 ϵ log 2 p states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of log p than the previously known construction. Our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some results in this direction.

Touchdown PCR for increased specificity and sensitivity in PCR amplification

Touchdown (TD) PCR offers a simple and rapid means to optimize PCRs, increasing specificity, sensitivity and yield, without the need for lengthy optimizations and/or the redesigning of primers. TD-PCR employs an initial annealing temperature above the projected melting temperature (T(m)) of the primers being used, then progressively transitions to a lower, more permissive annealing temperature over the course of successive cycles. Any difference in T(m) between correct and incorrect annealing will produce an exponential advantage of twofold per cycle. TD-PCR has found wide applicability in standard PCR protocols, including reverse transcriptase-dependent PCR, as well as in the generation of cDNA libraries and single nucleotide polymorphism screening. TD-PCR is particularly useful for templates that are difficult to amplify but can also be standardly used to enhance specificity and product formation. The procedure takes between 90 and 120 min, depending on the template length.

Quantum Versus Classical Proofs and Advice

This paper studies whether proofs are more powerful than classical proofs, or in complexity terms, whether QMA=QCMA. We prove three results about this question. First, we give a quantum oracle between QMA and QCMA. More concretely, we show that any algorithm needs $\Omega(\sqrt{2^n/(m+1)})$ queries to find an $n$-qubit marked state $\lvert\psi\rangle$, even if given an $m$-bit classical description of $\lvert\psi\rangle$ together with a black box that recognizes $\lvert\psi\rangle$. Second, we give an explicit QCMA protocol that nearly achieves this lower bound. Third, we show that, in the one previously-known case where proofs seemed to provide an exponential advantage, classical proofs are basically just as powerful. In particular, Watrous gave a QMA protocol for verifying non-membership in finite groups. Under plausible group-theoretic assumptions, we give a QCMA protocol for the same problem. Even with no assumptions, our protocol makes only polynomially many queries to the group oracle. We end with some conjectures about versus classical oracles, and about the possibility of a classical oracle separation between QMA and QCMA.

Entangling capacity of global phases and implications for the Deutsch-Jozsa algorithm

We investigate the creation of entanglement by the application of phases whose value depends on the state of a collection of qubits. First we give the necessary and sufficient conditions for a given set of phases to result in the creation of entanglement in a state comprising of an arbitrary number of qubits. Then we analyze the creation of entanglement between any two qubits in three qubit pure and mixed states. We use our result to prove that entanglement is necessary for Deutsch-Jozsa algorithm to have an exponential advantage over its classical counterpart.

Demonstration of quantum logic gates in liquid crystal nuclear magnetic resonance

H– 13 1 C heteronuclear dipolar couplings are used to produce the NMR (nuclear magnetic resonance) version of a two bit controlled-NOT quantum logic gate. This gate is coupled with the Hadamard gate to complete a circuit which generates the Einstein–Podolsky–Rosen (EPR) state which is the maximally entangled state of a pair of spins. The EPR state is crucial for the potential exponential speed advantage of quantum computers over their classical counterparts. We sample the deviation density matrix of the two spin system to verify the presence of the EPR state. EPR state lifetimes are also measured with this technique, thereby demonstrating the viability of liquid crystals as a platform for quantum computing.