Related papers: Non-trivial Area Operators Require Non-local Magic
It was recently shown by Harlow that any quantum error correcting code, satisfying the same complementary recovery properties as AdS/CFT, will obey a version of the Ryu-Takayanagi formula. In his most general result, Harlow allowed the bulk…
To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…
We provide a procedure to determine if a given nonlocal operator in a large N holographic CFT is dual to a local bulk operator on the geometry associated with a particular code subspace of the CFT. This procedure does not presuppose…
This paper investigates the tilt stability of local minimizers for nonlinear programs under the relaxed constant rank constraint qualification in finite dimensions. By employing a neighborhood primal-dual approach and extending calculus…
One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…
Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…
Simulating a fermionic system on a quantum computer requires encoding the anti-commuting fermionic variables into the operators acting on the qubit Hilbert space. The most familiar of which, the Jordan-Wigner transformation, encodes…
In this article, we conduct a study of integral operators defined in terms of non-convolution type kernels with singularities of various degrees. The operators that fall within our scope of research include fractional integrals, fractional…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
We consider two-point non-self-adjoint boundary eigenvalue problems for linear matrix differential operators. The coefficient matrices in the differential expressions and the matrix boundary conditions are assumed to depend analytically on…
We analyze the properties of the conditional amplitude operator, the quantum analog of the conditional probability which has been introduced in [quant-ph/9512022]. The spectrum of the conditional operator characterizing a quantum bipartite…
Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure…
Variational techniques have long been at the heart of atomic, solid-state, and many-body physics. They have recently extended to quantum and classical machine learning, providing a basis for representing quantum states via neural networks.…
We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes…
We derive extrinsic GJMS operators and $Q$-curvatures associated to a submanifold of a conformal manifold. The operators are conformally covariant scalar differential operators on the submanifold with leading part a power of the Laplacian…
Stabiliser operations occupy a prominent role in fault-tolerant quantum computing. They are defined operationally: by the use of Clifford gates, Pauli measurements and classical control. These operations can be efficiently simulated on a…
We find minimal regularity conditions on the coefficients of a parabolic operator, ensuring that no nontrivial solution tends to zero faster than any exponential.
A quantum error correcting code is a subspace $\mathcal{C}$ such that allowed errors acting on any state in $\mathcal{C}$ can be corrected. A quantum code for which state recovery is only required up to a logical rotation within…
In this thesis we shall demonstrate that a measurement of position alone in non-commutative space cannot yield complete information about the quantum state of a particle. Indeed, the formalism used entails a description that is non-local in…