相关论文: IQP computations with intermediate measurements
Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an…
We report an alternative scheme for implementing generalized quantum measurements that does not require the usage of auxiliary system. Our method utilizes solely: (a) classical randomness and post-processing, (b) projective measurements on…
We show that braidings of the metaplectic anyons $X_\epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for…
A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond…
The integer quantum Hall transition (IQHT) is one of the most mysterious members of the family of Anderson transitions. Since the 1980s, the scaling behavior near the IQHT has been vigorously studied in experiments and numerical…
Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the…
Interacting quantum systems illustrate complex phenomena including phase transitions to novel ordered phases. The universal nature of critical phenomena reduces their description to determining only the transition temperature and the…
We introduce a general framework, based on collision models and discrete CP-maps, to describe on an equal footing coherent and measurement-based feedback control of quantum mechanical systems. We apply our framework to prominent tasks in…
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied…
A foundational result in the theory of quantum computation known as the "principle of safe storage" shows that it is always possible to take a quantum circuit and produce an equivalent circuit that makes all measurements at the end of the…
Tensor networks permit computational and entanglement resources to be concentrated in interesting regions of Hilbert space. Implemented on NISQ machines they allow simulation of quantum systems that are much larger than the computational…
The intensely studied measurement-induced entanglement phase transition has become a hallmark of non-unitary quantum many-body dynamics. Usually, such a transition only shows up at the level of each individual quantum trajectory, and is…
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
While the circuit model of quantum computation defines its logical depth or "computational time" in terms of temporal gate sequences, the measurement-based model could allow totally different temporal ordering and parallelization of logical…
Quantum computation (QC) and simulation rely on long-lived qubits with controllable interactions. Early work in quantum computing made use of molecules because of their readily available intramolecular nuclear spin coupling and chemical…
Disordered quantum magnets are not only experimentally relevant, but offer efficient computational methodologies to calculate the low energy states as well as various measures of quantum correlations. Here, we present a systematic analysis…
The notion of universal quantum computation can be generalized to multi-level qudits, which offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are pristine and well-controlled quantum systems, offer an…
This note describes how the the scalable ZXH calculus can be used to represent in a compact way the quantum gates that are diagonal in the computational basis. This includes controlled and multi-controlled Z gates, their generalizations,…
We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $\mathit{CCZ}$…
Quantum computing offers transformative potential for simulating real-world materials, providing a powerful platform to investigate complex quantum systems across quantum chemistry and condensed matter physics. In this work, we leverage…