### Quantum-computing related developments

On this page we post about interesting quantum-computing related research and news which we are following.

On this page we post about interesting quantum-computing related research and news which we are following.

February 15, 2018

- Source: Arxiv

The perceptron algorithm dates back to the late 1950s and is an algorithm for supervised learning of binary classifiers. In a 2016 paper, Wiebe et al. proposed a quantum algorithm (based on Grover’s quantum-search approach), which can quadratically speed-up the training of a perceptron. In this paper, Zheng et al. describe their design for a quantum-circuit to implement the training-algorithm of Wiebe et al. They also analyze the resource requirements (qubits and gates) and demonstrate the feasibility of their quantum-circuit by testing it on the ibmqx5 (a 16 qubit universal gate quantum processor developed by IBM)

February 9, 2018

- Source: Arxiv

Atomic ions can be trapped by electric fields in ultra-high vacuum and then laser-cooled to extremely low temperatures. The internal states of such a trapped ion can be used to encode a qubit. Such qubit systems have very long coherence times and their internal states can be precisely manipulated using lasers, and measured efficiently. Current, room temperature, systems are limited to 50 ions to to collisions with background gas. At cryogenic temperatures (4K) , most of the residual background gas is trapped enabling further scale-up of ion-trap systems. In this paper, Pagano et al. present experimental results from a trapped ion system with such cryogenic-pumping, which enables them to trap over 100 ions in a linear configuration for hours, paving the way for future quantum simulation of spin models that are intractable with classical computer modelling.

February 6, 2018

- Source: Arxiv

Usually quantum information is encoded into a single, well-controlled degree of freedom, such as a spin. In some cases, however, establishing so called hyper-entanglement among several degrees-of-freedom (e.g. photon path, polarization and angular momentum), can be beneficial, e.g. improve the capacity of dense coding in linear optics. In this paper, Li et al. propose a scheme that allows to combine both (single degree-of-freedom) entanglement and hyper-entanglement. Specifically, they show how two identical, initially separated particles can become spin-entangled, momenta-entangled and spin-and-momenta-hyper-entangled.

February 5, 2018

- Source: Arxiv

Coupling between superconducting qubits is typically controlled not by changing the qubit-qubit coupling constant, but by suppressing the coupling by detuning their transition frequency. This approach becomes much more difficult with a high number of qubits, due to the ever-more crowded transition-frequency spectrum. In this paper, Casparis et al. demonstrate an alternative coupling scheme, in the form of a voltage controlled quantum-bus with the ability to change the effective qubit-qubit coupling by a factor of 8 between the on- and off-states without causing significant qubit decoherence.

February 1, 2018

- Source: Arxiv

Change point detection is a vast branch of statistical analysis developing techniques for uncovering abrupt changes in the underlying probability distribution of streaming data. This can be done off-line (using time-series data) or online (processing data sequentially). The latter enables real-time decision making, require less memory and is most relevant in machine learning. In this paper, Sentis et al. discuss online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states. They show that the identification of the change point can be done without error via sequential local measurements, requiring only one classical bit of memory between subsequent measurements.

January 30, 2018

- Source: Arxiv

Transition metal dichalcogenide monolayers (TMDC) are atomic-thin two-dimensional materials in which electrostatic quantum dots (QD) can be created. The electrons or holes confined in these QD have not only a spin degree of freedom, but also a valley degree of freedom. This additional degree of freedom can be used to encode a qubit creating a new field of electronics called valleytronics. In this paper Pawlowski et al. show how to create a QD in a MoS2 monolayer material and how to perform the NOT operation on its valley degree of freedom.

January 30, 2018

- Source: Arxiv

In the 2016 US presidential elections, many of the professional polling groups had overestimated the probability of a Clinton victory. Multiple post-election analyses concluded that a leading cause of error in their forecast models was a lack of correlation between predictions for individual states. Uncorrelated models, though much simpler to build and train, cannot capture the more complex behavior of a fully-connected system. Accurate, reliable sampling from fully-connected graphs with arbitrary correlations quickly becomes classically intractable as the graph size grows. In this paper, Henderson et al. show an initial implementation of quantum-trained Boltzmann machine used for sampling from correlated systems. They show that such a quantum-trained machine is able to generate election forecasts with similar structural properties and outcomes as a best in class modeling group.

January 28, 2018

- Source: Arxiv

Entanglement-based quantum repeaters aim to extend the range of quantum-communication. Typically, entanglement-based quantum repeaters apply a (nested) combination of entanglement swapping and distillation to create high fidelity entangled pairs over longer distances, with polynomially growing local resources and moderate rates. In this paper, Zwerger et al. introduce an alternative type of quantum repeater employing hashing, a deterministic entanglement distillation protocol with one-way communication, and show that this high-fidelity scheme is scalable to arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates.

January 26, 2018

- Source: Arxiv

In this paper, Djidjev et al. evaluate the performance of the D-Wave 2X quantum annealer on two NP-hard graph problems: clique finding and graph partitioning. Overall, they conclude that general problems which allow to be mapped onto the D-Wave architecture are typically still too small to show a quantum speedup (although the D-wave does provide similar quality solutions as the classical solvers). For simple simulated annealing algorithms, D-Wave is considerably faster and selected instances especially designed to fit D-Wave's particular chimera architecture can be solved orders of magnitude faster than with classical techniques.

January 26, 2018

- Source: Arxiv

Quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstrained binary (QUBO) programs. However, the relatively small number of available qubits poses a severe limitation to the range of problems that can be solved. In this paper, Hahn et al. explore the suitability of preprocessing methods for reducing the sizes of the input programs and thereby the number of qubits required for their solution on quantum computers. Specifically preprocessing reductions are discussed for max. clique and max. cut problems.

Page 3 of 8