Related papers: Measurement-based uncomputation of quantum circuit…
How well can multiple incompatible observables be implemented by a single measurement? This is a fundamental problem in quantum mechanics with wide implications for the performance optimization of numerous tasks in quantum information…
Quantum state preparation, also known as encoding or embedding, is a crucial initial step in many quantum algorithms and often constrains theoretical quantum speedup in fields such as quantum machine learning and linear equation solvers.…
In this research, we create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers, and it is compatible with…
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…
The limited computational power of constant-depth quantum circuits can be boosted by adapting future gates according to the outcomes of mid-circuit measurements. We formulate computation of a variety of Boolean functions in the framework of…
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…
Joint measurements of two-Pauli observables are a powerful tool for both the control and protection of quantum information. By following a simple recipe for measurement choices, single- and two- qubit rotations using two-Pauli parity and…
Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected…
An n-qubit quantum register can in principle be completely controlled by operating on a single qubit that interacts with the register via an appropriate fixed interaction. We consider a hypothetical system consisting of n spin-1/2 nuclei…
Quantum measurement is important to quantum computing as it extracts the outcome of the circuit at the end of the computation. Previously, all measurements have to be done at the end of the circuit. Otherwise, it will incur significant…
As quantum technology advances, the efficient design of quantum circuits has become an important area of research. This paper provides an introduction to the MCT quantum circuit design problem for reversible Boolean functions with the…
Quantum measurements based on mutually unbiased bases (MUB) play crucial roles in foundational studies and quantum information processing. It is known that there exist inequivalent MUB, but little is known about their operational…
The construction of quantum computers is based on the synthesis of low-cost quantum circuits. The quantum circuit of any Boolean function expressed in a Positive Polarity Reed-Muller $PPRM$ expansion can be synthesized using…
Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are…
Mutually unbiased bases (MUBs) constitute the canonical example of incompatible quantum measurements. One standard application of MUBs is the task known as quantum random access code (QRAC), in which classical information is encoded in a…
This paper presents a method for constructing quantum circuits for schoolbook multiplication using controlled add-subtract circuits, asymptotically halving the Toffoli count compared to traditional controlled-adder-based constructions.…
Pauli-based computation (PBC) is a universal measurement-based quantum computation model steered by an adaptive sequence of independent and compatible Pauli measurements on separable magic-state qubits. Here, we propose several new…
Controlled unitary gates are a basic element in many quantum algorithms. Converting a general unitary $U$ with a known decomposition into its controlled version, controlled-$U$, can introduce a large overhead in terms of the depth of the…
On noisy intermediate-scale quantum (NISQ) devices, expectation values of many observables are obtained through sampling-based approximations to trace-like quantities. A central limitation of this approach is destructive cancellation under…
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…