Related papers: Transport Implementation of the Bernstein-Vazirani…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
We propose a new scalable architecture for trapped ion quantum computing that combines optical tweezers delivering qubit state-dependent local potentials with oscillating electric fields. Since the electric field allows for long-range…
We discuss a simple search problem which can be pursued with different methods, either on a classical or on a quantum basis. The system is represented by a chain of trapped ions. The ion to be searched is a member of that chain, consists,…
Quantum computers hold the promise to solve certain problems exponentially faster than their classical counterparts. Trapped atomic ions are among the physical systems in which building such a computing device seems viable. In this work we…
Trapped ions in radio-frequency traps are among the leading approaches for realizing quantum computers, due to high-fidelity quantum gates and long coherence times. However, the use of radio-frequencies presents a number of challenges to…
The probability of successfully controlled teleportating an unknown qubit using a general three-particle state is investigated. We give the analytic expressions of maximal probabilities of successfully controlled teleportating an unknown…
Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain…
Most attempts to produce a scalable quantum information processing platform based on ion traps have focused on the shuttling of ions in segmented traps. We show that an architecture based on an array of microtraps with fast gates will…
We investigate the realization of a simple solid-state quantum computer by implementing the Deutsch-Jozsa algorithm in a system of Josephson charge qubits. Starting from a procedure to carry out the one-qubit Deutsch-Jozsa algorithm we show…
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algorithm is not far from optimal. The moral is that the need to…
Single ions held in linear Paul traps are promising candidates for a future quantum computer. Here, we discuss a two-layer microstructured segmented linear ion trap. The radial and axial potentials are obtained from numeric field…
We propose and numerically simulate a semiconductor device based on coupled quantum wires, suitable for deterministic quantum teleportation of electrons trapped in the minima of surface acoustic waves.We exploit a network of interacting…
We experimentally demonstrate a quantum walk on a line in phase space using one and two trapped ion. A walk with up to 23 steps is realized by subjecting an ion to state-dependent displacement operations interleaved with quantum coin…
We propose a method for scaling trapped ions for large-scale quantum computation and communication based on a probabilistic ion-photon mapping. Deterministic quantum gates between remotely located trapped ions can be achieved through…
We investigate the influences of variables on a Boolean function $f$ based on the quantum Bernstein-Vazirani algorithm. A previous paper (Floess et al. in Math. Struct. in Comp. Science 23: 386, 2013) has proved that if a $n$-variable…
We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in input a basic feasible solution and is composed by two main…
Surface ion traps confining and manipulating tens of ion qubits have become the leading platform for quantum processors with high quantum volume. These devices employ the Quantum Charge-Coupled Device (QCCD) architecture, wherein multiple…
Trapped ions are excellent candidates for quantum nodes, as they possess many desirable features of a network node including long-lifetimes, on-site processing capability and produce photonic flying qubits. However, unlike classical…
Binary networks are extremely efficient as they use only two symbols to define the network: $\{+1,-1\}$. One can make the prior distribution of these symbols a design choice. The recent IR-Net of Qin et al. argues that imposing a Bernoulli…
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output…