The optimal estimation of a quantum mechanical 2-state system (qubit) - with N identically prepared qubits available - is obtained by measuring all qubits simultaneously in an entangled basis. We report the experimental estimation of qubits using a succession of N measurements on individual qubits where the measurement basis is changed during the estimation procedure conditioned on the outcome of previous measurements (self-learning estimation). The performance of this adaptive algorithm is compared with other algorithms using measurements in a factorizing basis.
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations indicate that the running time grows only quadratically with the number of qubits.
We study a model of dephasing (decoherence) in a two-state quantum system (qubit) coupled to a bath of harmonic oscillators. An exact analytic solution for the reduced dynamics of a two-state system in this model has been obtained previously for factorizing initial states of the combined system. We show that the model admits exact solutions for a large class of correlated initial states which are typical in the theory of quantum measurements. We derive exact expressions for the off-diagonal elements of the qubit density matrix, which hold for an arbitrary strength of coupling between the qubit…
We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base 2, base 3, or base d representation. In operating the algorithm, the number n < N = d^K is read into a K-qudit register through its interaction with a stream of n particles passing in a nearby wire; this step corresponds to a quantum Fourier transformation from the Hilbert space of particles to the Hilbert space of qudit states. An inverse quantum Fourier transformation pr…
In this paper, an unextendible product basis and exact-entanglement bases of three qubit is given, and the properties of entanglement for exact-entanglement bases are also discussed. In addition, the bound entangled mixed state is obtained from the exact-entanglement bases.
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit designs and can be formulated for very general field-matter interactions. It is shown that, most generally, gates are described by a set of coined quantum walks. Rotating wave and resonant approximations for field-matter interaction simplify the walks, factorizing the coin, and leading to pure continuous time quantum walk description. The walks reside on a …
Fast and reliable reset of a qubit is a key prerequisite for any quantum technology. For real world open quantum systems undergoing non-Markovian dynamics, reset implies not only purification, but in particular erasure of initial correlations between qubit and environment. Here, we derive optimal reset protocols using a combination of geometric and numerical control theory. For factorizing initial states, we find a lower limit for the entropy reduction of the qubit as well as a speed limit. The time-optimal solution is determined by the maximum coupling strength. Initial correlations, remarkab…
Common flux qubit readout schemes are qubit dominated, meaning they measure in the energy eigenbasis of the qubit. For various applications meausrements in a basis different from the energy eigenbasis are required. Here we present an indirect measurement protocol, which is detector dominated instead of qubit dominated, yielding a projective measurements in the persistent current basis for arbitrary bias points. We show that with our setup it is possible to perform a quantum nondemolition measurement (QND) in the persistent current basis at all flux bias points with fidelities reaching almost 1…
There is a natural orthogonal basis of the 6-qubit decoherence-free (DF) space robust against collective noise. Interestingly, most of the basis states can be obtained from one another just permuting qubits. This property: (a) is useful for encoding qubits in DF subspaces, (b) allows the implementation of the Bennett-Brassard 1984 (BB84) protocol in DF subspaces just permuting qubits, which completes a the method for quantum key distribution using DF states proposed by Boileau et al. [Phys. Rev. Lett. 92, 017901 (2004)], and (c) points out that there is only one 6-qubit DF state which is essen…
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach allows to introduce more stable calculation basis for quantum computer based on the solid state NMR systems.
It is suggested to map the qubits into solid state NMR spin system collective states instead of the states of the individual spin. Such an approach introduces the stable computational basis without any additional actions and allows to obtain the universal set of quantum gates, which operation time is determined only by a RF pulse duration.
We consider the cloning of sequences of qubits prepared in the states used in the BB84 or 6-state quantum cryptography protocol, and show that the single-qubit fidelity is unaffected even if entire sequences of qubits are prepared in the same basis. This result is of great importance for practical quantum cryptosystems because it reduces the need for high-speed random number generation without impairing on the security against finite-size attacks.
An open question in designing superconducting quantum circuits is how best to reduce the full circuit Hamiltonian which describes their dynamics to an effective two-level qubit Hamiltonian which is appropriate for manipulation of quantum information. Despite advances in numerical methods to simulate the spectral properties of multi-element superconducting circuits, the literature lacks a consistent and effective method of determining the effective qubit Hamiltonian. Here we address this problem by introducing a novel local basis reduction method. This method does not require any ad hoc assumpt…
Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state with Hamming weight |x| at most n/2, it is possible to reconstruct |x| with success probability 1 - |x|/(n-|x|+1), and thus to compute any symmetric function of x. We give explicit algorithms for computing whether or not |x| is at least t for some t, and for computing the parity of x, and show that these are essentially optimal. These results can be seen as ge…
We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\{H,T\}$ basis. We propose two classical algorithms for quantum circuit compilation: the first algorithm has expected polynomial time (in precision $\log(1/ε)$) and offers a depth/precision guarantee that improves upon state-of-the-art methods for compiling into the $\{H,T\}$ basis by factors ranging from 1.86 to $\log_2(5)$. The second algorithm is analogous to direct search and yields ci…
In the postprocessing of quantum key distribution, the raw key bits from the mismatched-basis measurements, where two parties use different bases, are normally discarded. Here, we propose a postprocessing method that exploits measurement statistics from mismatched-basis cases, and prove that incorporating these statistics enables uncharacterized qubit sources to be used in the measurement-device-independent quantum key distribution protocol and the Bennett-Brassard 1984 protocol, a case which is otherwise impossible.
We study how single-qubit dispersive readout works alongside two qubit coupling. To make calculations analytically tractable, we use a simplified model which retains core characteristics of but is discretised compared to dispersive homodyne detection. We show how measurement speed and power determine what information about the qubit(s) is accessed. Specifically we find the basis the measurement is closest to projecting onto. Compared to the basis gates are applied in, this measurement basis is modified by the presence of photons in the readout resonator.
In the Hilbert space of n qubits, we introduce the symplectic space (n odd) and the orthogonal space (n even) via the spin-flip operator. Under this mathematical structure we discuss some properties of n qubits, including homomorphically mapping the local operations of n qubits into the symplectic group or orthogonal group, and prove that the generalized ``magic basis'' is just the bi-orthonormal basis (that is, the orthonormal basis of both Hilbert space and the orthogonal space ). Finally, an example is given to discuss the application in physics of this mathematical structure.
In this paper, we define a cross product operator and construct the cross Bell basis, by use this basis and Bell measurements we give a simple scheme of the teleportation of arbitrary multipartite qubit entanglement.
We consider the qubit initial state preparation due to the nonselective measurements on an overcomplete basis, when the number of outcomes $N=3$. To be specific, we have chosen the dephasing model and applied the conditions for a post-measurement state to ensure a gradual coherence enhancement at the initial stage of the system evolution. It is shown that contrary to the von Neumann-Lüders projection scheme with $N=2$, the most mixed post-measurement state of the qubit in the general case can depend on the bath temperature. This remarkable feature allows one to consider a ``temperature control…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as well as the NOT gate and multiply-controlled-Z gates, we describe a systematic approach to identifying the set of U(2) rotations required to implement each gate for any qudit of size N and with minimal use of an ancilla level. The qudit gates are analyzed in terms of the total rotation count and gate depth as the system scales with D. We apply the qudit-basi…
The Pauli operators (tensor products of Pauli matrices) provide a complete basis of operators on the Hilbert space of N qubits. We prove that the set of 4^N-1 Pauli operators may be partitioned into 2^N+1 distinct subsets, each consisting of 2^N-1 internally commuting observables. Furthermore, each such partitioning defines a unique choice of 2^N+1 mutually unbiased basis sets in the N-qubit Hilbert space. Examples for 2 and 3 qubit systems are discussed with emphasis on the nature and amount of entanglement that occurs within these basis sets.
Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be deterministically and probabilistically teleported by a quantum gate teleportation scheme using different basis of measurement. Additionally, we present examples of teleportation of two-qubit gates that do not belong to Clifford group as well the limitations of the quantum gate teleportation scheme employing a four-qubit state with genuine four-way entanglement.
We analyze some special properties of a system of two qubits, and in particular of the so-called Bell basis for this system, which have played an important role in recent papers on entanglement of qubits. In particular, we show which of these properties may be generalized to higher dimension. We give a general construction for bases of maximally entangled vectors in any dimension, but show that none of the properties related to complex conjugation in Bell basis can be realized for higher dimensional analogs.
We examine the problem of determining if a 2-local Hamiltonian is stoquastic by local basis changes. We analyze this problem for two-qubit Hamiltonians, presenting some basic tools and giving a concrete example where using unitaries beyond Clifford rotations is required in order to decide stoquasticity. We report on simple results for $n$-qubit Hamiltonians with identical 2-local terms on bipartite graphs. Our most significant result is that we give an efficient algorithm to determine whether an arbitrary $n$-qubit XYZ Heisenberg Hamiltonian is stoquastic by local basis changes.
The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit Y-shaped graph, and for a family of graph states with an arbitrary number of qubits.
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX- or XY-type gate). This strict hardware uniformity requirement for 2Q gat…
We use a single squeezed state to represent a qubit, which can be coherently processed in a deconvolution picture (DP) in the presence of noise. We avail ourselves of the fact that when evolution is governed by a quadratic dissipative equation, there exists a basis of squeezed states that evolves to another basis of such states in the DP. An operator acts as an impurity filter, restoring the coherence lost from the inexorable interactions of the qubit with its surroundings.
We analyze the effect of position dependent excitation phase on the properties of entanglement between two qubits formed in atomic systems. We show that the excitation phase induces a vacuum mediated quantum interference in the system that affects the dynamical behavior of entanglement between the qubits. It is also found that the quantum interference leads to a coherent population transfer between the symmetric and antisymmetric states which can considerably modify the dynamics of two-qubit entanglement and can even prevent finite time disentanglement (sudden death) under certain conditions.
An orthogonal product basis (OPB) of a finite-dimensional Hilbert space $H=H_1\otimes H_2\otimes\cdots\otimes H_n$ is an orthonormal basis of $H$ consisting of product vectors $x_1\otimes x_2\otimes\cdots\otimes x_n$. We show that the problem of classifying the OPBs of an $n$-qubit system can be reduced to a purely combinatorial problem. We solve this combinatorial problem in the case of four qubits and obtain 33 multiparameter families of OPBs. Each OPB of four qubits is equivalent, under local unitary operations and qubit permutations, to an OPB belonging to at least one of these families.
Interaction-resolved decomposition of multi-qubit unitaries via computational-basis phases
Forschungszentrum Jülich（于利希研究中心）；Institute for Theoretical Physics, University of Cologne（科隆大学理论物理研究所）；Dipartimento di Fisica e Astronomia, Università di Bologna（博洛尼亚大学物理与天文学系）
Quantum entanglement cannot be unlimitedly shared among arbitrary number of qubits. Larger the number of entangled pairs in an N-qubit system, smaller the degree of bi-partite entanglement is. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement (measured in the concurrence) between any pair of qubits is 2/N. This tight bound can be achieved when the qubits are prepared in a pure symmetric (with respect to permutations) state with just one qubit in the basis state |0> and the others in the basis state |1>.
We report on an optimal single-electron charge qubit for a solid-state double quantum dot (DQD) system and analyse its dynamics under a time-dependent linear detuning, using GPU accelerated numerical solutions to the time-dependent Schrödinger equation. The optimal qubit is found to have basis states defined as the symmetric and antisymmetric linear combinations of the lowest energy bonding and anti-bonding states of the DQD at zero bias. In contrast to charge qubits defined by the two localised ground states of the uncoupled DQD, this choice of the basis causes the resulting dynamics to have …
We investigate the dynamics of classical and quantum correlations between two qubits. Each qubit is implemented by a pair of phosphorous impurities embedded in a silicon substrate. The main decoherence mechanism affecting these types of qubits is provided by the coupling of the phosphorous impurities to the acoustical vibrations of the silicon lattice. We find that depending on the temperature of the substrate and the initial state, three different dynamics can be found. These are characterized by the number of abrupt changes in both classical and quantum correlations. We also show that the co…
In this paper, different from the other existing methods that only the special and limited numbers of qubits transmit between Alice and Bob, a general method is proposed to implement Bidirectional Quantum Controlled/uncontrolled Teleportation (BQCT/BQT) that Alice and Bob can transmit each type of arbitrary n and m-qubits to each other, simultaneously. This protocol is based on Controlled-NOT (CNOT) operation, appropriate single-qubit unitary operations and single-qubit measurement in the Z-basis and X-basis. Also, the quantum channel can be created by using Hadamard and CNOT operations. One o…
We present a basis-set-free approach to the variational quantum eigensolver using an adaptive representation of the spatial part of molecular wavefunctions. Our approach directly determines system-specific representations of qubit Hamiltonians while fully omitting globally defined basis sets. In this work, we use directly determined pair-natural orbitals on the level of second-order perturbation theory. This results in compact qubit Hamiltonians with high numerical accuracy. We demonstrate initial applications with compact Hamiltonians on up to 20 qubits where conventional representation would…
Phase-sensitive framed-ribbon representation of single-qubit Pauli measurements in linear cluster states
Indian Institute of Technology, Indore（印度印多尔理工学院）；Techno Main Salt Lake (Engg. Colg.), Techno India Group（Techno India集团Salt Lake技术主校区（工程学院））；Centre of Advanced Studies and Innovation Lab (CASILAB)（先进研究与创新实验室（CASILAB））
The long-lived, efficient storage and retrieval of a qubit encoded on a photon is an important ingredient for future quantum networks. Although systems with intrinsically long coherence times have been demonstrated, the combination with an efficient light-matter interface remains an outstanding challenge. In fact, the coherence times of memories for photonic qubits are currently limited to a few milliseconds. Here we report on a qubit memory based on a single atom coupled to a high-finesse optical resonator. By mapping and remapping the qubit between a basis used for light-matter interfacing a…
We propose an experiment that realizes a symmetric informationally complete (SIC) probability-operator measurement (POM) in the four-dimensional Hilbert space of a qubit pair. The qubit pair is carried by a single photon as a polarization qubit and a path qubit. The implementation of the SIC POM is accomplished with the means of linear optics. The experimental scheme exploits a new approach to SIC POMs that uses a two-step process: a measurement with full-rank outcomes, followed by a projective measurement on a basis that is chosen in accordance with the result of the first measurement. The ba…
We consider multi-qubit systems and relate quantitatively the problems of generating cluster states with high value of concurrence of assistance, and that of generating states with maximal bipartite entanglement. We prove an upper bound for the concurrence of assistance. We consider dynamics of spin-1/2 systems that model qubits, with different couplings and possible presence of magnetic field to investigate the appearance of the discussed entanglement properties. We find that states with maximal bipartite entanglement can be generated by an XY Hamiltonian, and their generation can be controll…
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and ${σ_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $π$) single-qubit gate, and hence, is potentially the…
We study the Markovian dynamics of a collection of n quantum systems coupled to an irreversible environmental channel consisting of a stream of n entangled qubits. Within the framework of repeated quantum interactions, we derive the master equation that describes the dynamics of the composite quantum system. We investigate the evolution of the joint system for two-qubit environments and find that (1) the presence of antidiagonal coherences (in the local basis) in the environment is a necessary condition for entangling two remote systems, and (2) that maximally entangled two-qubit baths are an …
Based on an EPR pair of qubits and allowing asymptotically secure key distribution, a secure communication protocol is presented. Bob sends either of the EPR pair qubits to Alice. Alice receives the travel qubit. Then she can encode classical information by local unitary operations on this travel qubit. Alice send the qubit back to Bob. Bob can get Alice's information by measurement on the two photons in Bell operator basis. If Eve in line, she has no access to Bob's home qubit. All her operations are restricted to the travel qubit. In order to find out which opeartion Alice performs, Eve's op…
We propose a strategy for engineering multi-qubit quantum gates. As a first step, it employs an eigengate to map states in the computational basis to eigenstates of a suitable many-body Hamiltonian. The second step employs resonant driving to enforce a transition between a single pair of eigenstates, leaving all others unchanged. The procedure is completed by mapping back to the computational basis. We demonstrate the strategy for the case of a linear array with an even number N of qubits, with specific XX+YY couplings between nearest neighbors. For this so-called Krawtchouk chain, a 2-body dr…
We consider the use of feedback control during a measurement to increase the rate at which a single qubit is purified, and more generally the rate at which near-pure states may be prepared. We derive the optimal bang-bang algorithm for rapid state preparation from an initially completely mixed state when the measurement basis is unrestricted, and evaluate its performance numerically. We also consider briefly the case in which the measurement basis is fixed with respect to the state to be prepared, and describe the qualitative structure of the optimal bang-bang algorithm.
Necessary conditions for separability are most easily expressed in the computational basis, while sufficient conditions are most conveniently expressed in the spin basis. We use the Hadamard matrix to define the relationship between these two bases and to emphasize its interpretation as a Fourier transform. We then prove a general sufficient condition for complete separability in terms of the spin coefficients and give necessary and sufficient conditions for the complete separability of a class of generalized Werner densities. As a further application of the theory, we give necessary and suffi…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the two-dimensional 1-qubit space. In this paper, we show that H and P(.) suffice to generate the unitary group U(2) and, consequently, through controlled-U operations and their concatenations, the entire unitary group U(2^n) on n-qubits can be generated. Since any quantum computing algorithm in an n-qubit quantum computer is based on operations by matrices in U(2^n), i…
Charge-based qubits have been proposed as fundamental elements for quantum computers. One commonly proposed readout device is the single-electron transistor (SET). SETs can distinguish between localized charge states, but lack the sensitivity to directly distinguish superposition states, which have greatly enhanced coherence times compared with position states. We propose introducing a third dot, and exploiting energy dependent tunnelling from the qubit into this dot (bias spectroscopy) for pseudo-spin to charge conversion and superposition basis readout. We introduce an adiabatic fast passage…
