We develop connections between generalised notions of entanglement and quantum computational devices where the measurements available are restricted, either because they are noisy and/or because by design they are only along Pauli directions. By considering restricted measurements one can (by considering the dual positive operators) construct single particle state spaces that are different to the usual quantum state space. This leads to a modified notion of entanglement that can be very different to the quantum version (for example, Bell states can become separable). We use this approach to develop alternative methods of classical simulation that have strong connections to the study of non-local correlations: we construct noisy quantum computers that admit operations outside the Clifford set and can generate some forms of multiparty quantum entanglement, but are otherwise classical in that they can be efficiently simulated classically and cannot generate non-local statistics. Although the approach provides new regimes of noisy quantum evolution that can be efficiently simulated classically, it does not appear to lead to significant reductions of existing upper bounds to fault tolerance thresholds for common noise models.
A unified formalism was developed in [S. Adhikary et. al., arXiv:1710.04371 [quant-ph]], for describing non-classicality of states by introducing pseudo projection operators in which both quantum logic and quantum probability are naturally embedded. In this paper we show, as the first practical application, how non-locality and entanglement emerge as two such important manifestations. It provides a perspective complementary to (i) the understanding of them that we have currently (in terms of LHV models) and (ii) to the algebraic approaches employed. The work also makes it possible to obtain, i…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We prove that a universal gate set for quantum computing cannot be realised by supplementing locality-preserving logical operators with defect braiding, even in more than two dimensions. However, notwithstanding this no-go theorem, we demonstrate that higher dimensional defect-braiding schemes have the potential to play an important role in realising fault-tolerant…
Tensors and traceouts are generalised, so that systems can be partitioned according to almost arbitrary logical predicates. One might have feared that the familiar interrelations between the notions of unitarity, complete positivity, trace-preservation, non-signalling causality, locality and localizability that are standard in quantum theory be jeopardized as the partitioning of systems becomes both logical and dynamical. Such interrelations in fact carry through, although a new notion, consistency, becomes instrumental.
Recently, Bravyi and König have shown that there is a tradeoff between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant depth geometrically local circuit and are thus fault-tolerant by construction. In particular, they shown that, for local stabilizer codes in D spatial dimensions, locality preserving gates are restricted to a set of unitary gates known as the D-th level of the Clifford hierarchy. In this paper, we elaborate this idea and provide several extensions and appli…
The framework of generalized probabilistic theories (GPT) is a widely-used approach for studying the physical foundations of quantum theory. The standard GPT framework assumes the no-restriction hypothesis, in which the state space of a physical theory determines the set of measurements. However, this assumption is not physically motivated. In Janotta and Lal [Phys. Rev. A 87, 052131 (2013)], it was shown how this assumption can be relaxed, and how such an approach can be used to describe new classes of probabilistic theories. This involves introducing a new, more general, definition of maxima…
Stabilizer codes are a simple and successful class of quantum error-correcting codes. Yet this success comes in spite of some harsh limitations on the ability of these codes to fault-tolerantly compute. Here we introduce a new metric for these codes, the disjointness, which, roughly speaking, is the number of mostly non-overlapping representatives of any given non-trivial logical Pauli operator. We use the disjointness to prove that transversal gates on error-detecting stabilizer codes are necessarily in a finite level of the Clifford hierarchy. We also apply our techniques to topological code…
This chapter provides an introduction to the use of diagrammatic language, or perhaps more accurately, diagrammatic calculus, in quantum information and quantum foundations. We illustrate the use of diagrammatic calculus in one particular case, namely the study of complementarity and non-locality, two fundamental concepts of quantum theory whose relationship we explore in later part of this chapter. The diagrammatic calculus that we are concerned with here is not merely an illustrative tool, but it has both (i) a conceptual physical backbone, which allows it to act as a foundation for diverse …
We present a quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on concatenated codes. To realize fault-tolerant quantum computing, the fault-tolerant quantum protocols should be transformed into executable quantum circuits based on the nearest-neighbor interaction. Unlike topological codes that are defined based on local operations fundamentally, for the concatenated codes, it is possible to obtain the circuits composed of the local operations by applying the quantum circuit synthesis. However, by the existing quantum circuit synthesis develo…
Although our understanding of Bell's theorem and experimental techniques to test it have improved over the last 40 years, thus far all Bell tests have suffered at least from the detection or the locality loophole. Most photonic Bell tests rely on inefficient discrete-outcome measurements, often provided by photon counting detection. One possible way to close the detection loophole in photonic Bell tests is to involve efficient continuous-variable measurements instead, such as homodyne detection. Here, we propose a test of the Clauser-Horne-Shimony-Holt (CHSH) inequality that applies photon cou…
Recently,the principle of nonviolation of information causality [Nature 461,1101 (2009)], has been proposed as one of the foundational properties of nature. We explore the Hardy's nonlocality theorem for two qubit systems, in the context of generalised probability theory, restricted by the principle of nonviolation of information causality. Applying, a sufficient condition for information causality violation, we derive an upper bound on the maximum success probability of Hardy's nonlocality argument. We find that the bound achieved here is higher than that allowed by quantum mechanics,but stil…
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due to encoding. We carry out a detailed semi-numerical threshold analysis for concatenated coding using the 7-qubit CSS code in the local and `nonlocal' setting. First, we find that the threshold in the local model for the [[7,1,3]] code has a 1/r dependence, which is in correspondence with our analytical estimate. Second, the threshold, beyond the 1/r depende…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for universal fault-tolerant quantum computing in any spatial dimension. In particular, we show that, for the natural encoding of quantum information in defects in topological stabiliser codes, the set of logical operators implementable by braiding defects is contained in the Clifford group. Indeed, we show that this remains true even when supplemented with locality-p…
We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits. The generalised model is based on the group algebras $\mathbb{C}\mathbb{Z}_d$ for $d \geq 2$. It still requires magic state injection for universal quantum computation. We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.
From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP is in AWPP. This work investigates limits on computational power that are imposed by physical principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusion still holds? …
Yau Mathematical Sciences Center, Tsinghua University（清华大学丘成桐数学科学中心）；Joint Center for Quantum Information and Computer Science, University of Maryland（马里兰大学量子信息与计算机科学联合中心）
We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems. As well as proving this concretely for several specific codes, we argue that this restriction naturally arises in any stabilizer subsystem code that comes close to capturing certain properties of holography. We extend these results to approximate encodings, l…
We present two results on the subject of quantum contextuality and cohomology, and non-locality and quantum advantage with shallow circuits. Abramsky et al. showed that a range of examples of quantum contextuality is detected by a cohomological invariant based on Čech cohomology. However, the approach does not give a complete cohomological characterisation of contextuality. A different cohomological approach to contextuality was introduced by Okay et al. Their approach exploits the algebraic structure of the Pauli operators and their qudit generalisations known as Weyl operators. We give an ab…
Considering the large-scale quantum computer, it is important to know how much quantum computational resources is necessary precisely and quickly. Unfortunately the previous methods so far cannot support a large-scale quantum computing practically and therefore the analysis because they usually use a non-structured code. To overcome this problem, we propose a fast mapping by using the hierarchical assembly code which is much more compact than the non-structured code. During the mapping process, the necessary modules and their interconnection can be dynamically mapped by using the communication…
We propose a family of non-locality unique games for 2 parties based on a square lattice on an arbitrary surface. We show that, due to structural similarities with error correction codes of Kitaev for fault tolerant quantum computation, the games have classical values computable in polynomial time for $d=2$ measurement outcomes. By representing games in their graph form, for arbitrary $d$ and underlying surface we provide their classification into equivalence classes with respect to relabeling of measurement outcomes, for a selected set of permutations which define the winning conditions. A ca…
The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical principles and computation. Moreover, comparing and contrasting the computational properties of quantum theory with other operationally-sensible theories could shed light on the strengths and limitations of quantum computation. This paper reviews and extends some of these results, deriving new bounds on the computational ability of theories satisfying n-local tomogra…
Transpiler-Architecture Co-Design to Curb Clifford Costs in Fault-Tolerant Quantum Computing
The University of British Columbia（不列颠哥伦比亚大学）；Pacific Northwest National Laboratory（太平洋西北国家实验室）；University of California San Diego（加州大学圣地亚哥分校）；The University of Texas at Austin（德克萨斯大学奥斯汀分校）；University of Washington（华盛顿大学）
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using …
Cambridge Quantum Computing Limited（剑桥量子计算有限公司）；Imperial College London（伦敦帝国理工学院）；University of Edinburgh（爱丁堡大学）
Generative modelling is an important unsupervised task in machine learning. In this work, we study a hybrid quantum-classical approach to this task, based on the use of a quantum circuit Born machine. In particular, we consider training a quantum circuit Born machine using $f$-divergences. We first discuss the adversarial framework for generative modelling, which enables the estimation of any $f$-divergence in the near term. Based on this capability, we introduce two heuristics which demonstrably improve the training of the Born machine. The first is based on $f$-divergence switching during tr…
We study restrictions on locality-preserving unitary logical gates for topological quantum codes in two spatial dimensions. A locality-preserving operation is one which maps local operators to local operators --- for example, a constant-depth quantum circuit of geometrically local gates, or evolution for a constant time governed by a geometrically-local bounded-strength Hamiltonian. Locality-preserving logical gates of topological codes are intrinsically fault tolerant because spatially localized errors remain localized, and hence sufficiently dilute errors remain correctable. By invoking gene…
The study of causal relations has recently been applied to the quantum realm, leading to the discovery that not all physical processes have a definite causal structure. While indefinite causal processes have previously been experimentally shown, these proofs relied on the quantum description of the experiments. Yet, the same experimental data could also be compatible with definite causal structures within different descriptions. Here, we present the first demonstration of indefinite temporal order outside of quantum formalism. We show that our experimental outcomes are incompatible with a clas…
Classification of Generalised Triorthogonal Codes through Length 54
Massachusetts Institute of Technology（麻省理工学院）；IBM Research, IBM T. J. Watson Research Center（IBM 研究院，IBM T.J. 沃森研究中心）；Joint Center for Quantum Information and Computer Science, NIST, University of Maryland（量子信息与计算科学联合中心，美国国家标准与技术研究院，马里兰大学）
Using a process-theoretic formalism, we introduce the notion of a causal-inferential theory: a triple consisting of a theory of causal influences, a theory of inferences (of both the Boolean and Bayesian varieties), and a specification of how these interact. Recasting the notions of operational and realist theories in this mold clarifies what a realist account of an experiment offers beyond an operational account. It also yields a novel characterization of the assumptions and implications of standard no-go theorems for realist representations of operational quantum theory, namely, those based …
Through the introduction of a new electron spin transport mechanism, a 2D donor electron spin quantum computer architecture is proposed. This design addresses major technical issues in the original Kane design, including spatial oscillations in the exchange coupling strength and cross-talk in gate control. It is also expected that the introduction of a degree of non-locality in qubit gates will significantly improve the scaling fault-tolerant threshold over the nearest-neighbour linear array.
A quantum system interacts with its environment, if ever so slightly, no matter how much care is put into isolating it. As a consequence, quantum bits (qubits) undergo errors, putting dauntingly difficult constraints on the hardware suitable for quantum computation. New strategies are emerging to circumvent this problem by encoding a qubit non-locally across the phase space of a physical system. Since most sources of decoherence are due to local fluctuations, the foundational promise is to exponentially suppress errors by increasing a measure of this non-locality. Prominent examples are topolo…
Geometry-optimized hyperbolic codes for modular fault-tolerant quantum architectures
University of Saskatchewan（萨斯喀彻温大学）；Centre for Quantum Topology and Its Applications (quanTA)（量子拓扑及其应用中心）；Department of Mathematics and Statistics（数学与统计系）
Quantum mechanics admits correlations that cannot be explained by local realistic models. Those most studied are the standard local hidden variable models, which satisfy the well-known Bell inequalities. To date, most works have focused on bipartite entangled systems. Here, we consider correlations between three parties connected via two independent entangled states. We investigate the new type of so-called "bilocal" models, which correspondingly involve two independent hidden variables. Such models describe scenarios that naturally arise in quantum networks, where several independent entangle…
We propose a new scheme of measurement-based quantum computation (MBQC) using an error-correcting code against photon-loss in circuit quantum electrodynamics. We describe a specific protocol of logical single-qubit gates given by sequential cavity measurements for logical MBQC and a generalised Schrödinger cat state is used for a continuous-variable (CV) logical qubit captured in a microwave cavity. It is assumed that a three CV-qudit entangled state is initially prepared in three jointed cavities and the microwave qudit states are individually controlled, operated, and measured through a read…
Generalised Bit-Vector Abstractions for Formal Verification of Quantum Error-Detection and Entanglement Circuits over {H,X,C-NOT}: CSS Constructions, Soundness, and Mutation-Based Validation
