In order to prepare for the introduction of dynamical many-body and, eventually, field theoretical models, we show here that quantum mechanical exchange interactions in a three-spin chain can emerge from the deterministic dynamics of three classical Ising spins. States of the latter form an ontological basis, which will be discussed with reference to the ontology proposed in the Cellular Automaton Interpretation of Quantum Mechanics by 't Hooft. Our result illustrates a new Baker-Campbell-Hausdorff formula with terminating series expansion.
Quantum key distribution schemes which employ encoding on vacuum-one-photon qubits are capable of transferring more information bits per particle than the standard schemes employing polarization or phase coding. We calculate the maximum number of classical bits per particle that can be securely transferred when the key distribution is performed with the BB84 and B92 protocols, respectively, using the vacuum-one-photon qubits. In particular, we show that for a generalized B92 protocol with the vacuum-one-photon qubits, a maximum of two bits per particle can be securely transferred. We also demo…
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous decay errors. To prove the result, we use elementary number theory with prior theory on permutation invariant codes and quantum error correction.
A novel use of Majorana geometric representation brings out distinct entanglement families of permutation symmetric states of qubits. The paradigmatic W and GHZ (Greenberger-Horne-Zeilinger) states of three qubits respectively contain two and three independent Majorana spinors. Another unique state with three distinct Majorana spinors -- constructed through a permutation symmetric superposition of two up qubits and one down qubit (W state) and its obverse state Wbar) exhibits genuine three-party entanglement, which is robust under loss of a qubit. While the GHZ state has irreducible correlatio…
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…
Decoherence in quantum computer memory due to the inevitable coupling to the external environment is examined. We take the assumption that all quantum bits (qubits) interact with the same environment rather than the assumption of separate environments for different qubits. It is found that the qubits are decohered collectively. For some kinds of entangled input states, no decoherence occurs at all in the memory even if the qubits are interacting with the environment. Based on this phenomenon, a scheme is proposed for reducing the collective decoherence. We also discuss possible implications of…
Entanglement properties of a basic set of eight entangled three particle pure states possessing certain permutation symmetries are studied. They fall into four sets of two entangled states, differing in their patterns of robustness to entanglement when one of the states is lost. These features are related to the permutation symmetries of the spin states of the three particles and their corresponding marginal two-particle states. It is interesting to note that the eight entangled three-qubit states discussed here are eigenstates of a three-spin Heisenberg Hamiltonian.
A quantum cellular network with a qubit and ancilla bits in each cell is proposed. The whole circuit works only with the help of external optical pulse sequences. In the operation, some of the ancilla bits are activated, and autonomous single- and two-qubit operations are made. In the sleep mode of a cell, the decoherence of the qubit is negligibly small. Since only two cells at most are active at once, the coherence can be maintained for a sufficiently long time for practical purposes. A device structure using a quantum dot array with possible operation and measurement schemes is also propose…
Random numbers are critical for any cryptographic application. However, the data that is flowing through the internet is not secure because of entropy deprived pseudo random number generators and unencrypted IoTs. In this work, we address the issue of lesser entropy of several data formats. Specifically, we use the large information space associated with the n-qubit permutation matrices to expand the entropy of any data without increasing the size of the data. We take English text with the entropy in the range 4 - 5 bits per byte. We manipulate the data using a set of n-qubit (n $\leq$ 10) per…
Mutually unbiased bases determine an optimal set of measurements to extract complete information about the quantum state of a system. However, quite often a priori information about the state exist, making some of the measurement bases superfluous. This is, for example, the case when multiqubit states belong to the permutationally invariant subspace. In this paper we derive the minimal sets of mutually unbiased bases needed to tomographically reconstruct such states.
In this work we consider the permutational properties of multipartite entanglement monotones. Based on the fact that genuine multipartite entanglement is a property of the entire multi-qubit system, we argue that ideal definitions for its characterizing quantities must be permutation-invariant. Using this criterion, we examine the three 4-qubit entanglement monotones introduced by Osterloh and Siewert [Phys. Rev. A. 72, 012337]. By expressing them in terms of quantities whose permutational properties can be easily derived, we find that one of these monotones is not permutation-invariant. We pr…
We show that a qubit can be used to substitute for an arbitrarily large number of classical bits. We consider a physical system S interacting locally with a classical field phi(x) as it travels directly from point A to point B. The field has the property that its integrated value is an integer multiple of some constant. The problem is to determine whether the integer is odd or even. This task can be performed perfectly if S is a qubit. On the otherhand, if S is a classical system then we show that it must carry an arbitrarily large amount of classical information. We identify the physical reas…
Cryptographic random number generation is critical for any quantum safe encryption. Based on the natural uncertainty of some quantum processes, variety of quantum random number generators or QRNGs have been created with physical quantum processes. They generally generate random numbers with good unpredictable randomness. Of course, physical QRNGs are costic and require physical integrations with computing systems. This paper proposes a pseudo quantum random number generator with a quantum algorithm called quantum permutation pad or QPP, leveraging the high entropy of quantum permutation space …
A scheme is proposed for protecting quantum states from both independent decoherence and cooperative decoherence. The scheme operates by pairing each qubit (two-state quantum system) with an ancilla qubit and by encoding the states of the qubits into the corresponding coherence-preserving states of the qubit-pairs. In this scheme, the amplitude damping (loss of energy) is prevented as well as the phase damping (dephasing) by a strategy called the free-Hamiltonian-elimination We further extend the scheme to include quantum gate operations and show that loss and decoherence during the gate opera…
One fundamental requirement for quantum computation is to perform universal manipulations of quantum bits at rates much faster than the qubit's rate of decoherence. Recently, fast gate operations have been demonstrated in logical spin qubits composed of two electron spins where the rapid exchange of the two electrons permits electrically controllable rotations around one axis of the qubit. However, universal control of the qubit requires arbitrary rotations around at least two axes. Here we show that by subjecting each electron spin to a magnetic field of different magnitude we achieve full qu…
The remarkable transmission of two bits of information via a single qubit entangled with another at the destination, is presented as an expansion of the unremarkable classical circuit that transmits the bits with two direct qubit-qubit couplings between source and destination
It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning of entanglement is nevertheless allowed by quantum mechanics. We investigate a separability-preserving optimal cloning machine that duplicates all maximally-entangled states of two qubits, resulting in 0.285 bits of entanglement per clone, while a local cloning machine only yields 0.060 bits of entanglement per clone.
We consider a Quantum Computer with n quantum-bits (`qubits'), where each qubit is coupled independently to an environment affecting the state in a dephasing or depolarizing way. For mixed states we suggest a quantification for the property of showing {\it quantum} uncertainty on the macroscopic level. We illustrate in which sense a large parameter can be seen as an indicator for large entanglement and give hypersurfaces enclosing the set of separable states. Using methods of the classical theory of maximum likelihood estimation we prove that this parameter is decreasing with 1/\sqrt{n} for al…
We consider general prepare-and-measure scenarios in which Alice can transmit qubit states to Bob, who can perform general measurements in the form of positive operator-valued measures (POVMs). We show that the statistics obtained in any such quantum protocol can be simulated by the purely classical means of shared randomness and two bits of communication. Furthermore, we prove that two bits of communication is the minimal cost of a perfect classical simulation. In addition, we apply our methods to Bell scenarios, which extends the well-known Toner and Bacon protocol. In particular, two bits o…
We show that the pure entangled three-qubit symmetric states which are inequivalent under stochastic local operations and classcial communication (SLOCC) exhibit distinct geometric representation in terms of a spheroid inscribed within the Bloch sphere. We provide detailed analysis of the SLOCC canonical forms of the reduced two-qubit states extracted from entangled three-qubit pure symmetric states. Based on the Lorentz canonical forms of these states we arrive at two different geometrical representations: (i) a prolate spheroid centered at the origin of the Bloch sphere -- with longest semia…
In the endeavour to make quantum computers a reality, integrated superconducting circuits have become a promising architecture. A major challenge of this approach is decoherence originating from spurious atomic tunneling defects at the interfaces of qubit electrodes, which may resonantly absorb energy from the qubit's oscillating electric field and reduce the qubit's energy relaxation time $T_1$. Here, we show that qubit coherence can be improved by tuning dominating defects away from the qubit resonance using an applied DC-electric field. We demonstrate a method that optimizes the applied fie…
We show that violation of variance based local sum uncertainty relation (LSUR) for angular momentum operators of a bipartite system, proposed by Hofmann and Takeuchi~[Phys.Rev.A {\bf 68}, 032103 (2003)], reflects entanglement in the equal bipartitions of an $N$-qubit symmetric state with even qubits. We establish the one-to-one connection with the violation of LSUR with negativity of covariance matrix [Phys. Lett. A, {\bf 364}, 203 (2007)] of the two-qubit reduced system of a permutation symmetric $N$-qubit state.
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. In order to test our results experimentally, we utilize IBM's $5$-qubit quantum processor to realize the algorithm …
The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with high fidelity (higher than 0.9997). Particularly, these quantum gates were chosen to perform the permutation algorithm (Z. Gedik et al., Scientific reports 5, 14671, (2015).) in hybrid qubits in a double quantum dot (DQD) platform. The permutation algorithm is an oracle based quantum algorithm that solves the problem of the permutation parity faster than a classical algorithm without the necessity of entanglement between particles. The only requirement for achieving the speedup i…
Permutation-Invariant N-body gates via Tavis-Cummings Hamiltonian
Duke Quantum Center and Department of Physics, Duke University（杜克大学量子中心与物理系）；Department of Electrical and Computer Engineering, Duke University（杜克大学电气与计算机工程系）
We introduce a setup which realises a tunable engineered environment for experiments in circuit quantum electrodynamics. We illustrate this concept with the specific example of a quantum bit, qubit, in a high-quality-factor cavity which is capacitively coupled to another cavity including a resistor. The temperature of the resistor, which acts as the dissipative environment, can be controlled in a well defined manner in order to provide a hot or cold environment for the qubit, as desired. Furthermore, introducing superconducting quantum interference devices (SQUIDs) into the cavity containing t…
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
We introduce a general odd qubit entangled system composed of GHZ and Bell pairs and explicate its usefulness for quantum teleportation, information splitting and superdense coding. After demonstrating the superdense coding protocol on the five qubit system, we prove that '2N +1' classical bits can be sent by sending 'N+1' quantum bits using this channel. It is found that the five-qubit system is also ideal for arbitrary one qubit and two qubit teleportation and quantum information splitting (QIS). For the single qubit QIS, three different protocols are feasible, whereas for the two qubit QIS,…
We consider the entanglement manipulation capabilities of the universal covariant quantum cloner or quantum processor circuit for quantum bits. We investigate its use for cloning a member of a bipartite or a genuine tripartite entangled state of quantum bits. We find that for bipartite pure entangled states a nontrivial behavior of concurrence appears, while for GHZ entangled states a possibility of the partial extraction of bipartite entanglement can be achieved.
In previous studies, we have explored the ansatz that the volume elements of the Bures metrics over quantum systems might serve as prior distributions, in analogy to the (classical) Bayesian role of the volume elements ("Jeffreys' priors") of Fisher information metrics. Continuing this work, we obtain exact Bures probabilities that the members of certain low-dimensional subsets of the fifteen-dimensional convex set of 4 x 4 density matrices are separable or classically correlated. The main analytical tools employed are symbolic integration and a formula of Dittmann (quant-ph/9908044) for Bures…
Quantum teleportation allows for the transfer of arbitrary, in principle, unknown quantum states from a sender to a spatially distant receiver, who share an entangled state and can communicate classically. It is the essence of many sophisticated protocols for quantum communication and computation. In order to realize flying qubits in these schemes, photons are an optimal choice, however, teleporting a photonic qubit has been limited due to experimental inefficiencies and restrictions. Major disadvantages have been the fundamentally probabilistic nature of linear-optics Bell measurements as wel…
Dynamical decoupling of spin qubits in silicon can enhance fidelity and be used to extract the frequency spectra of noise processes. We demonstrate a full-permutation dynamical decoupling technique that cyclically exchanges the spins in a triple-dot qubit. This sequence not only suppresses both low frequency charge-noise- and magnetic-noise-induced errors; it also refocuses leakage errors to first order, which is particularly interesting for encoded exchange-only qubits. For a specific construction, which we call NZ1y, the qubit is isolated from error sources to such a degree that we measure a…
We investigate the usefulness of a recently introduced five qubit state by Brown $\it et al. \normalfont$ \cite{Brown} for quantum teleportation, quantum state sharing and superdense coding. It is shown that this five-qubit state can be utilized for perfect teleportation of arbitrary single and two qubit systems. We devise various schemes for quantum state sharing of an arbitrary single and two particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits…
The Variational Quantum Eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers. However, the circuit depth is expected to grow significantly with problem size. Increased depth can both degrade the accuracy of the results and reduce trainability. In this work, we propose a novel approach to reduce ansatz circuit depth. Our approach, called PermVQE, adds an additional optimization loop to VQE that permutes qubits in order to solve for the qubit Hamiltonian that minimizes long-range correlations in the ground state…
We present the NMR implementation of a recently proposed quantum algorithm to find the parity of a permutation. In the usual qubit model of quantum computation, speedup requires the presence of entanglement and thus cannot be achieved by a single qubit. On the other hand, a qutrit is qualitatively more quantum than a qubit because of the existence of quantum contextuality and a single qutrit can be used for computing. We use the deuterium nucleus oriented in a liquid crystal as the experimental qutrit. This is the first experimental exploitation of a single qutrit to carry out a computational …
Quantities invariant under local unitary transformations are of natural interest in the study of entanglement. This paper deduces and studies a particularly simple quantity that is constructed from a combination of two standard permutations of the density matrix, namely realignment and partial transpose. This bipartite quantity, denoted here as $R_{12}$, vanishes on large classes of separable states including classical-quantum correlated states, while being maximum for only maximally entangled states. It is shown to be naturally related to the 3-tangle in three qubit states via their two-qubit…
We develop an analytical model for describing the dynamics of a donor-based charge quantum bit (qubit). As a result, the quantum decoherence of the qubit is analytically obtained and shown to reveal non-Markovian features: The decoherence rate varies with time and even attains negative values, generating a non-exponential decay of the electronic coherence and a later recoherence. The resulting coherence time is inversely proportional to the temperature, thus leading to low decoherence below a material dependent characteristic temperature.
We provide explicit schemes for quantum information splitting (QIS) of real or equatorial two qubit states among two parties, through the five particle cluster and Brown states respectively. The schemes introduced are neither fully deterministic nor completely probabilistic and are carried out in the case where, the information that is to be shared is partially or fully known to the sender. We show that, QIS can be accomplished with just two classical bits, as against four classical bits, when the information is unknown to the sender.
We propose two deterministic secure quantum communication (DSQC) protocols employing three-qubit GHZ-like states and five-qubit Brown states as quantum channels for secure transmission of information in units of two bits and three bits using multipartite teleportation schemes developed here. In these schemes, the sender's capability in selecting quantum channels and the measuring bases leads to improved qubit efficiency of the protocols.
Global unitary transformations (OPTSWAPS) that optimally increase the bias of any mixed computation qubit in a quantum system -- represented by a diagonal density matrix -- towards a particular state of the computational basis which, in effect, increases its purity are presented. Quantum circuits that achieve this by implementing the above data compression technique -- a generalization of the 3B-Comp used before -- are described. These circuits enable purity increment in the computation qubit by maximally transferring part of its von Neumann or Shannon entropy to any number of surrounding qubi…
Real quantum systems couple to their environment and lose their intrinsic quantum nature through the process known as decoherence. Here we present a method for minimizing decoherence by making it energetically unfavorable. We present a Hamiltonian made up solely of two-body interactions between four two-level systems (qubits) which has a two-fold degenerate ground state. This degenerate ground state has the property that any decoherence process acting on an individual physical qubit must supply energy from the bath to the system. Quantum information can be encoded into the degeneracy of the gr…
We describe a general procedure for mapping arbitrary $n$-qubit states to two-dimensional (2D) vector fields. The mappings use complex rational function representations of individual qubits, producing classical vector field configurations that can be interpreted in terms of 2D inviscid fluid flows or electric fields. Elementary qubits are identified with localized defects in 2D harmonic vector fields, and multi-qubit states find natural field representations via complex superpositions of vector field products. In particular, separable states appear as highly symmetric flow configurations, maki…
A common strategy to measure the Abelian geometric phase for a qubit is to let it evolve along an 'orange slice' shaped path connecting two antipodal points on the Bloch sphere by two different semi- great circles. Since the dynamical phases vanish for such paths, this allows for direct measurement of the geometric phase. Here, we generalize the orange slice setting to the non-Abelian case. The proposed method to measure the non-Abelian geometric phase can be implemented in a cyclic chain of four qubits with controllable interactions.
We investigate the intermediate permutational symmetries of a system of qubits, that lie in between the perfect symmetric and antisymmetric cases. We prove that, on average, pure states of qubits picked at random with respect to the uniform measure on the unit sphere of the Hilbert space are almost as antisymmetric as they are allowed to be. We then observe that multipartite entanglement, measured by the generalized Meyer- Wallach measure, tends to be larger in subspaces that are more antisymmetric than the complete symmetric one. Eventually, we prove that all states contained in the most anti…
It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is not the case when we are encrypting quantum bits. For the perfect encryption of n quantum bits, 2n bits of entropy are necessary and sufficient (quantum one-time pad), but for approximate encryption one asymptotically needs only n bits of entropy. In this paper, we provide the optimal trade-off between the approximation measure epsilon and the amount of cla…
The entanglement dynamics of a pair of donor-based charge qubits is obtained in analytical form. The disentanglement is induced by off resonant scattering of acoustical phonons in the semiconductor host. According to our results a rather unusual recovery of entanglement occurs that depends on the geometrical configuration of the qubits. In addition, for large times a non-vanishing stationary entanglement is predicted. For the cases of one and two initial excitations a simple kinetic interpretation allows for an adequate analysis of the observed dynamics. Our results also reveal a direct relati…
