相关论文: Boolean Functions, Projection Operators and Quantu…
An observable effects a schematization of the Quantum event structure by correlating Boolean algebras picked by measurements with the Borel algebra of the real line. In a well-defined sense Boolean observables play the role of…
In this paper we show that there is a direct correspondence between quantum Boolean operations and certain forms of classical (non-quantum) logic known as Reed-Muller expansions. This allows us to readily convert Boolean circuits into their…
We study the subfield subcodes of projective Reed-Solomon codes and their duals: we provide bases for these codes and estimate their parameters. With this knowledge, we can construct symmetric and asymmetric entanglement-assisted quantum…
In this work, we consider the problem of learning nonlinear operators that correspond to discrete-time nonlinear dynamical systems with inputs. Given an initial state and a finite input trajectory, such operators yield a finite output…
We introduce a notion of nuclear numerical range defined as the set of expectation values of a given operator $A$ among normalized pure states, which belong to the nucleus of an auxiliary operator $Z$. This notion proves to be applicable to…
The quantum error correction theory is as a rule formulated in a rather convoluted way, in comparison to classical algebraic theory. This work revisits the error correction in a noisy quantum channel so as to make it intelligible to…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
For every idempotent $Q$ on a Hilbert space $H$, the matched projection $m(Q)$ is a well-established concept. This paper explores several applications of the matched projections. The first application addresses the distances from…
Refinement calculus provides a structured framework for the progressive and modular development of programs, ensuring their correctness throughout the refinement process. This paper introduces a refinement calculus tailored for quantum…
We propose a quantum algorithm to estimate the Gowers $U_2$ norm of a Boolean function, and extend it into a second algorithm to distinguish between linear Boolean functions and Boolean functions that are $\epsilon$-far from the set of…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
We investigate the performance of a quantum error-correcting code when pushed beyond its intended capacity to protect information against errors, presenting formulae for the probability of failure when the errors affect more qudits than…
Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…
We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and circuits are naturally interpretable in such structures. We consider…
Quantum error correction is expected to be essential in large-scale quantum technologies. However, the substantial overhead of qubits it requires is thought to greatly limit its utility in smaller, near-term devices. Here we introduce a new…
In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors…
Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of…
Error-correcting codes are usually envisioned to counter errors by operating unitary corrections depending on the projective measurement results of some syndrome observables. We here propose a way to use them in a more integrated way, where…
This work is concerned with two-spin-1/2-fermion relativistic quantum mechanics, and it is about the construction of one-particle projectors using an inherently two(many)-particle, `explicitly correlated' basis representation, necessary for…
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…