Consider the model of computation where we start with two halves of a $2n$-qubit maximally entangled state. We get to apply a universal quantum computation on one half, measure both halves at the end, and perform classical postprocessing. This model, which we call $\frac12$BQP, was defined in STOC 2017 [ABKM17] to capture the power of permutational computations on special input states. As observed in [ABKM17], this model can be viewed as a natural generalization of the one-clean-qubit model (DQC1) where we learn the content of a high entropy input state only after the computation is completed. An interesting open question is to characterize the power of this model, which seems to sit nontrivially between DQC1 and BQP. In this paper, we show that despite its limitations, this model can carry out many well-known quantum computations that are candidates for exponential speed-up over classical computations (and possibly DQC1). In particular, $\frac12$BQP can simulate Instantaneous Quantum Polynomial Time (IQP) and solve the Deutsch-Jozsa problem, Bernstein-Vazirani problem, Simon's problem, and period finding. As a consequence, $\frac12$BQP also solves Order Finding and Factoring outside of the oracle setting. Furthermore, $\frac12$BQP can solve Forrelation and the corresponding oracle problem given by Raz and Tal [RT22] to separate BQP and PH. We also study limitations of $\frac12$BQP and show that similarly to DQC1, $\frac12$BQP cannot distinguish between unitaries which are close in trace distance, then give an oracle separating $\frac12$BQP and BQP. Due to this limitation, $\frac12$BQP cannot obtain the quadratic speedup for unstructured search given by Grover's algorithm [Gro96]. We conjecture that $\frac12$BQP cannot solve $3$-Forrelation.
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0> state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor intermediate measurements. The main results of this paper are unexpectedly strong error-reducible properties of such quantum computations. It is proved that any problem solvable by a polynomial-time quantum computation with one-sided bounded error that uses logarithmically many clean qubits can also be…
The one clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single input qubit is pure and all other input qubits are maximally mixed. In spite of the severe restriction, the model can solve several problems (such as calculating Jones polynomials) whose classical efficient solutions are not known. Furthermore, it was shown that if the output probability distribution of the one clean qubit model can be classically efficiently sampled with a constant multiplicative error, then the polynomial hierarchy collapses to the second level. Is it possible to impr…
We present reversible classical circuits for performing various arithmetic operations aided by dirty ancillae (i.e. extra qubits in an unknown state that must be restored before the circuit ends). We improve the number of clean qubits needed to factor an n-bit number with Shor's algorithm from 1.5n+O(1) to n+2, assisted by n-1 dirty qubits, without increasing the asymptotic size or depth of the circuit.
We study quantum communication protocols, in which the players' storage starts out in a state where one qubit is in a pure state, and all other qubits are totally mixed (i.e. in a random state), and no other storage is available (for messages or internal computations). This restriction on the available quantum memory has been studied extensively in the model of quantum circuits, and it is known that classically simulating quantum circuits operating on such memory is hard when the additive error of the simulation is exponentially small (in the input length), under the assumption that the polyno…
The one-clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single qubit of the initial state is pure and others are maximally mixed. Although the model is not universal, it can efficiently solve several problems whose classical efficient solutions are not known. Furthermore, it was recently shown that if the one-clean qubit model is classically efficiently simulated, the polynomial hierarchy collapses to the second level. A disadvantage of the one-clean qubit model is, however, that the clean qubit is too clean: for example, in realistic NMR experimen…
In a recent paper, Buscemi and al. defined a notion of clean positive operator valued measures (POVMs). We here characterize which POVMs are clean in some class that we call quasi-qubit POVMs, namely POVMs whose elements are all rank-one or full-rank. We give an algorithm to check whether a given quasi-qubit POVM satisfies to this condition. We describe explicitely all the POVMs that are clean for the qubit. On the way we give a sufficient condition for a general POVM to be clean.
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single clean qubit, and only a single output qubit is measured at the end of the computing. It is proved that the restriction of quantum computation to the DQC1 model does not change the complexity classes NQP and SBQP. As a main consequence, it follows that the DQC1 model cannot be efficiently simulated by classical computers unless the polynomial-time hierarchy collapses to the second level (more precisely, to AM), which ans…
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class. This is the class of problems solvable in polynomial time on a quantum computer acting on an initial state in which one qubit is pure and the rest are maximally mixed. Here we generalize this result by showing that one clean qubit computers can efficiently approximate the Jones and single-variab…
Entanglement has been shown to be necessary for pure state quantum computation to have an advantage over classical computation. However, it remains open whether entanglement is necessary for quantum computers that use mixed states to also have an advantage. The one clean qubit model is a form of quantum computer in which the input is the maximally mixed state plus one pure qubit. Previous work has shown that there is a limited amount of entanglement present in these computations, despite the fact that they can efficiently solve some problems that are seemingly hard to solve classically. This c…
It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be strictly weaker than standard quantum computers, but still capable of solving some classically intractable problems. Here we show that evaluating a certain approximation to the Jones polynomial at a fifth root of unit…
Deterministic quantum computation with one quantum bit (DQC1), or the one clean qubit model, [E. Knill and R. Laflamme, Phys. Rev. Lett. {\bf81}, 5672 (1998)] is a model of quantum computing where the input is the tensor product of a single pure qubit and many completely-mixed states, and only the single qubit is measured at the end of the computation. In spite of its naive appearance, the DQC1 model can efficiently solve some problems for which no classical efficient algorithms are known, and therefore it has been conjectured that the DQC1 model is more powerful than classical computing (unde…
We present a protocol to evaluate the expectation value of the correlations of measurement outcomes for ensembles of quantum systems, and use it to experimentally demonstrate--under an assumption of fair sampling--the violation of an inequality that is satisfied by any non-contextual hidden-variables (NCHV) theory. The experiment is performed on an ensemble of molecular nuclear spins in the solid state, using established Nuclear Magnetic Resonance (NMR) techniques for quantum information processing (QIP).
The Turaev-Viro invariants are scalar topological invariants of three-dimensional manifolds. Here we show that the problem of estimating the Fibonacci version of the Turaev-Viro invariant of a mapping torus is a complete problem for the one clean qubit complexity class (DQC1). This complements a previous result showing that estimating the Turaev-Viro invariant for arbitrary manifolds presented as Heegaard splittings is a complete problem for the standard quantum computation model (BQP). We also discuss a beautiful analogy between these results and previously known results on the computational …
Deterministic quantum computation with one quantum bit (DQC1) is a model of quantum computing where the input restricted to containing a single qubit in a pure state and with all other qubits in a completely-mixed state, with only a single qubit measurement at the end of the computation [E. Knill and R. Laflamme, Phys. Rev. Lett. {\bf81}, 5672 (1998)]. While it is known that DQC1 can efficiently solve several problems for which no known classical efficient algorithms exist, the question of whether DQC1 is really more powerful than classical computation remains open. In this paper, we introduce…
Unique properties of a ballistic DND or grain boundary D-D junction, including doubly degenerate ground state with tunable potential barrier between the "up" and "down" states and non-quantized spontaneous magnetic flux, make it a good candidate for a solid state qubit. The role of quantum "spin" variable is played by the sign of equilibrium superconducting phase difference on the junction, which is revealed in the direction of spontaneous supercurrent flow in equilibrium. Possibilities of design-specific simultaneous operations with several integrated qubits are discussed.
We show that a highly-mixed state in terms of a large min-entropy is useless as a resource state for measurement-based quantum computation in the sense that if a classically efficiently verifiable problem is efficiently solved with such a highly-mixed measurement-based quantum computation then such a problem can also be classically efficiently solved. We derive a similar result also for the DQC1$_k$ model, which is a generalized version of the DQC1 model where $k$ output qubits are measured. We also show that the measurement-based quantum computing on a highly-mixed resource state in terms of …
Quantum Uncomputation of Clean and Dirty Ancilla Qubits
Institute of Software, Chinese Academy of Sciences（中国科学院软件研究所）；University of Chinese Academy of Sciences（中国科学院大学）；Key Laboratory of System Software (Chinese Academy of Sciences)（系统软件重点实验室（中国科学院））；State Key Laboratory of Computer Science（计算机科学国家重点实验室）
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(ε_{\rm rel}\mathcal{Z} ))^2$, where $M$ is the dimension of the quantum system, $\mathcal{Z}$ is the partition function, and $ε_{\rm rel}$ is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated us…
We show that the quantum parity gate on $n > 3$ qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit unitary gates, regardless of the number of allowed ancilla qubits. This is the best known and first nontrivial separation between the parity gate and circuits of this form. The same bounds also apply to the quantum fanout gate. Our results are incomparable with those of Fang et al. [3], which apply to any constant depth but require a sublinear number of ancilla qubits on the simulating circuit.
Running quantum programs is fraught with challenges on on today's noisy intermediate scale quantum (NISQ) devices. Many of these challenges originate from the error characteristics that stem from rapid decoherence and noise during measurement, qubit connections, crosstalk, the qubits themselves, and transformations of qubit state via gates. Not only are qubits not "created equal", but their noise level also changes over time. IBM is said to calibrate their quantum systems once per day and reports noise levels (errors) at the time of such calibration. This information is subsequently used to ma…
By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than the one containing the answer) to their initial states at the end of the communication protocol? Protocols that achieve this are referred to as clean and the associated cost as the clean communication complexity. Here we present clean protocols for calculating the Inner Product of two $n$-bit strings, showing that (in the absence of pre-shared entanglement) at most $n+3$ qubits or $n+O(\sqrt{n})$ bits of communicati…
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…
We describe design, implementation and performance of an ultra-high vacuum (UHV) package for superconducting qubit chips or other surface sensitive quantum devices. The UHV loading procedure allows for annealing, ultra-violet light irradiation, ion milling and surface passivation of quantum devices before sealing them into a measurement package. The package retains vacuum during the transfer to cryogenic temperatures by active pumping with a titanium getter layer. We characterize the treatment capabilities of the system and present measurements of flux tunable qubits with an average T$_1=84~μ$…
QAC circuits are quantum circuits with one-qubit gates and Toffoli gates of arbitrary arity. QAC$^0$ circuits are QAC circuits of constant depth, and are quantum analogues of AC$^0$ circuits. We prove the following: $\bullet$ For all $d \ge 7$ and $\varepsilon>0$ there is a depth-$d$ QAC circuit of size $\exp(\mathrm{poly}(n^{1/d}) \log(n/\varepsilon))$ that approximates the $n$-qubit parity function to within error $\varepsilon$ on worst-case quantum inputs. Previously it was unknown whether QAC circuits of sublogarithmic depth could approximate parity regardless of size. $\bullet$ We introdu…
Key Laboratory of System Software (Chinese Academy of Sciences), Institute of Software, Chinese Academy of Sciences（中国科学院软件研究所系统软件重点实验室）；University of Chinese Academy of Sciences（中国科学院大学）；Leiden University（莱顿大学）；University of Edinburgh（爱丁堡大学）
University of Amsterdam（阿姆斯特丹大学）；QuSoft；Charles University, Prague, Czech Republic（布拉格查理大学）；Department of Computer Science, University of Oxford（牛津大学计算机系）
We present a scalable scheme for superconducting charge qubits with the assistance of one-dimensional superconducting transmission line resonator (STLR) playing the role of data bus. The coupling between qubit and data bus may be turned on and off by just controlling the gate voltage and externally applied flux of superconducting charge qubit. In our proposal, the entanglement between arbitrary two qubits and $W$ states of three qubits can be generated quickly and easily.
So far it has been shown that the quantum dynamics cannot be described as a classical Markov process unless the number of classical states is uncountably infinite. In this paper, we present a stochastic model with time-correlated noise that exactly reproduces any unitary evolution of a qubit and requires just four classical states. The invasive updating of just one bit during a measurement accounts for the quantum violation of the Leggett-Garg inequalities. Unlike in a pilot wave theory, the stochastic forces governing the jumps among the four states do not depend on the quantum state, but onl…
It is considered the indirect inter-qubit coupling in 1D chain of atoms with nuclear spins 1/2, which plays role of qubits in the quantum register. This chain of the atoms is placed by regular way in easy-axis 3D antiferromagnetic thin plate substrate, which is cleaned from the other nuclear spin containing isotopes. It is shown that the range of indirect inter-spin coupling may run to a great number of lattice constants both near critical point of quantum phase transition in antiferromagnet of spin-flop type (control parameter is external magnetic field) and/or near homogeneous antiferromagne…
What could happen if we pinned a single qubit of a system and fixed it in a particular state? First, we show that this can greatly increase the complexity of static questions -- ground state properties of local Hamiltonian problems with restricted types of terms. In particular, we show that the Pinned commuting and Pinned Stoquastic Local Hamiltonian problems are QMA complete. Second, we show that pinning a single qubit via often repeated measurements also results in universal quantum computation already with commuting and stoquastic Hamiltonians. Finally, we discuss variants of the Ground Sta…
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.
As the number of qubits available on noisy quantum computers grows, it will become necessary to efficiently select a subset of physical qubits to use in a quantum computation. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while r…
We present the first full experimental quantum tomographic characterization of a single-qubit device achieved with a single entangled input state. The entangled input state plays the role of all possible input states in quantum parallel on the tested device. The method can be trivially extended to any n-qubits device by just replicating the whole experimental setup n times.
It was shown by Ahn, Wiseman, and Milburn [PRA {\bf 67}, 052310 (2003)] that feedback control could be used as a quantum error correction process for errors induced by weak continuous measurement, given one perfectly measured error channel per qubit. Here we point out that this method can be easily extended to an arbitrary number of error channels per qubit. We show that the feedback protocols generated by our method encode $n-2$ logical qubits in $n$ physical qubits, thus requiring just one more physical qubit than in the previous case.
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. We also demonstrate that for the highly scalable Josephson junction charge qubits, the B gate is also more easily and quickly generated than the CNOT gate for physically feasibl…
We analyze and show experimental results of the conditional purity, the quantum discord and other related measures of quantum correlation in mixed two-qubit states constructed from a pair of photons in identical polarization states. The considered states are relevant for the description of spin pair states in interacting spin chains in a transverse magnetic field. We derive clean analytical expressions for the conditional local purity and other correlation measures obtained as a result of a remote local projective measurement, which are fully verified by the experimental results. A simple exac…
We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically implement universal quantum computation as well as multi-qubit entanglement based on unconventional geometric phase shifts in this scalable solid-state system. Some quantum error-correcting codes can also be easily constructed using the same technique. In view of the gate dependence on just global geometric features and the insensitivity to the state of cavity mode…
Quantum convolutional neural network (QCNN) has just become as an emerging research topic as we experience the noisy intermediate-scale quantum (NISQ) era and beyond. As convolutional filters in QCNN extract intrinsic feature using quantum-based ansatz, it should use only finite number of qubits to prevent barren plateaus, and it introduces the lack of the feature information. In this paper, we propose a novel QCNN training algorithm to optimize feature extraction while using only a finite number of qubits, which is called fidelity-variation training (FV-Training).
This paper presents a highly efficient decomposition scheme and its associated Mathematica notebook for the analysis of complicated quantum circuits comprised of single/multiple qubit and qudit quantum gates. In particular, this scheme reduces the evaluation of multiple unitary gate operations with many conditionals to just two matrix additions, regardless of the number of conditionals or gate dimensions. This improves significantly the capability of a quantum circuit analyser implemented in a classical computer. This is also the first efficient quantum circuit analyser to include qudit quantu…
The diamond nitrogen-vacancy (NV) center is an excellent candidate for quantum information processing, whereas entangling separate NV centers is still of great experimental challenge. We propose an one-step conditional phase flip with three NV centers coupled to a whispering-gallery mode cavity by virtue of the Raman transition and smart qubit encoding. As decoherence is much suppressed, our scheme could work for more qubits. The experimental feasibility is justified.
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large unitary matrix. We show that this problem is complete for the complexity class, and derive some further fundamental features of the class. We conclude with a discussion of some associated open conjectures and new oracle separations between classes.
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.
Steane's seven-qubit quantum code is a natural choice for fault-tolerance experiments because it is small and just two extra qubits are enough to correct errors. However, the two-qubit error-correction technique, known as "flagged" syndrome extraction, works slowly, measuring only one syndrome at a time. This is a disadvantage in experiments with high qubit rest error rates. We extend the technique to extract multiple syndromes at once, without needing more qubits. Qubits for different syndromes can flag errors in each other. This gives equally fast and more qubit-efficient alternatives to Ste…
Topological error-correcting codes, such as surface codes and color codes, are promising because quantum operations are realized by two-dimensionally (2D) arrayed quantum bits (qubits). However, physical wiring of electrodes to qubits is complicated, and 3D integration for the wiring requires further development of fabrication technologies. Here, we propose a method to reduce the congestion of wiring to qubits by just adding a SWAP gate after each controlled-NOT (CNOT) gate. SWAP gates exchange roles of qubits. Then, the roles of qubits are shared between different qubits. We found that our me…
We propose a method of the Bell bases decomposition to teleport an arbitrary unknown N-qubit state through a nonmaximally entangled quantum channel, and give the universal decomposition matrix of N-qubit. Using the decomposition matrix, we can easily obtain the collapsed state at the receiver site. The inverse matrix that the decomposition matrix is just the transformation matrix that the receiver can manipulate. The decomposition matrix is a function of the parameters of the quantum channel. After defining the sub-matrix of the quantum channel, we find that the decomposition matrix is a tenso…
Just as any state of a single qubit or 2-level system can be obtained from any other state by a rotation operator parametrized by three real Euler angles, we show how any state of an n-qubit or 2^n-level system can be obtained from any other by a compact unitary transformation with 2^(n+1)-1 real angles, 2^n of which are azimuthal-like and the rest polar-like. The results follow from a modeling of the Hilbert space of n-qubits by a minimal left ideal of an associative algebra. This representation is expected to be useful in the design of new compact control techniques or more efficient algorit…
We review an experimental technique used to correct state preparation and measurement errors on gate-based quantum computers, and discuss its rigorous justification. Within a specific biased quantum measurement model, we prove that nonideal measurement of an arbitrary $n$-qubit state is equivalent to ideal projective measurement followed by a classical Markov process $Γ$ acting on the output probability distribution. Measurement errors can be removed, with rigorous justification, if $Γ$ can be learned and inverted. We show how to obtain $Γ$ from gate set tomography (R. Blume-Kohout et al., arX…
Quantum bits based on Majorana zero modes are expected to be robust against certain noise types, and hence provide a quantum computing platform that is superior to conventional qubits. This robustness is not complete though: imperfections can still lead to qubit decoherence and hence to information loss. In this work, we theoretically study Majorana-qubit dephasing in a minimal model: in a Kitaev chain with quasistatic disorder. Our approach, based on numerics as well as first-order non-degenerate perturbation theory, provides a conceptually simple physical picture and predicts Gaussian dephas…
Entanglement properties of IBM Q 53 qubit quantum computer are carefully examined with the noisy intermediate-scale quantum (NISQ) technology. We study GHZ-like states with multiple qubits (N=2 to N=7) on IBM Rochester and compare their maximal violation values of Mermin polynomials with analytic results. A rule of N-qubits orthogonal measurements is taken to further justify the entanglement less than maximal values of local realism (LR). The orthogonality of measurements is another reliable criterion for entanglement except the maximal values of LR. Our results indicate that the entanglement …
