7,042 research outputs found
Encoding a qubit into multilevel subspaces
We present a formalism for encoding the logical basis of a qubit into
subspaces of multiple physical levels. The need for this multilevel encoding
arises naturally in situations where the speed of quantum operations exceeds
the limits imposed by the addressability of individual energy levels of the
qubit physical system. A basic feature of the multilevel encoding formalism is
the logical equivalence of different physical states and correspondingly, of
different physical transformations. This logical equivalence is a source of a
significant flexibility in designing logical operations, while the multilevel
structure inherently accommodates fast and intense broadband controls thereby
facilitating faster quantum operations. Another important practical advantage
of multilevel encoding is the ability to maintain full quantum-computational
fidelity in the presence of mixing and decoherence within encoding subspaces.
The formalism is developed in detail for single-qubit operations and
generalized for multiple qubits. As an illustrative example, we perform a
simulation of closed-loop optimal control of single-qubit operations for a
model multilevel system, and subsequently apply these operations at finite
temperatures to investigate the effect of decoherence on operational fidelity.Comment: IOPart LaTeX, 2 figures, 31 pages; addition of a numerical simulatio
Empirical consequences of symmetries
`Global' symmetries, such as the boost invariance of classical mechanics and
special relativity, can give rise to direct empirical counterparts such as the
Galileo-ship phenomenon. However, a widely accepted line of thought holds that
`local' symmetries, such as the diffeomorphism invariance of general relativity
and the gauge invariance of classical electromagnetism, have no such direct
empirical counterparts. We argue against this line of thought. We develop a
framework for analysing the relationship between Galileo-ship empirical
phenomena and physical theories that model such phenomena that renders the
relationship between theoretical and empirical symmetries transparent, and from
which it follows that both global and local symmetries can give rise to
Galileo-ship phenomena. In particular, we use this framework to exhibit analogs
of Galileo's ship for both the diffeomorphism invariance of general relativity
and the gauge invariance of electromagnetism.Comment: 31 pages including reference
Quantum measurements and the Abelian Stabilizer Problem
We present a polynomial quantum algorithm for the Abelian stabilizer problem
which includes both factoring and the discrete logarithm. Thus we extend famous
Shor's results. Our method is based on a procedure for measuring an eigenvalue
of a unitary operator. Another application of this procedure is a polynomial
quantum Fourier transform algorithm for an arbitrary finite Abelian group. The
paper also contains a rather detailed introduction to the theory of quantum
computation.Comment: 22 pages, LATE
Register automata with linear arithmetic
We propose a novel automata model over the alphabet of rational numbers,
which we call register automata over the rationals (RA-Q). It reads a sequence
of rational numbers and outputs another rational number. RA-Q is an extension
of the well-known register automata (RA) over infinite alphabets, which are
finite automata equipped with a finite number of registers/variables for
storing values. Like in the standard RA, the RA-Q model allows both equality
and ordering tests between values. It, moreover, allows to perform linear
arithmetic between certain variables. The model is quite expressive: in
addition to the standard RA, it also generalizes other well-known models such
as affine programs and arithmetic circuits.
The main feature of RA-Q is that despite the use of linear arithmetic, the
so-called invariant problem---a generalization of the standard non-emptiness
problem---is decidable. We also investigate other natural decision problems,
namely, commutativity, equivalence, and reachability. For deterministic RA-Q,
commutativity and equivalence are polynomial-time inter-reducible with the
invariant problem
Quantum Proofs
Quantum information and computation provide a fascinating twist on the notion
of proofs in computational complexity theory. For instance, one may consider a
quantum computational analogue of the complexity class \class{NP}, known as
QMA, in which a quantum state plays the role of a proof (also called a
certificate or witness), and is checked by a polynomial-time quantum
computation. For some problems, the fact that a quantum proof state could be a
superposition over exponentially many classical states appears to offer
computational advantages over classical proof strings. In the interactive proof
system setting, one may consider a verifier and one or more provers that
exchange and process quantum information rather than classical information
during an interaction for a given input string, giving rise to quantum
complexity classes such as QIP, QSZK, and QMIP* that represent natural quantum
analogues of IP, SZK, and MIP. While quantum interactive proof systems inherit
some properties from their classical counterparts, they also possess distinct
and uniquely quantum features that lead to an interesting landscape of
complexity classes based on variants of this model.
In this survey we provide an overview of many of the known results concerning
quantum proofs, computational models based on this concept, and properties of
the complexity classes they define. In particular, we discuss non-interactive
proofs and the complexity class QMA, single-prover quantum interactive proof
systems and the complexity class QIP, statistical zero-knowledge quantum
interactive proof systems and the complexity class \class{QSZK}, and
multiprover interactive proof systems and the complexity classes QMIP, QMIP*,
and MIP*.Comment: Survey published by NOW publisher
Desynchronization: Synthesis of asynchronous circuits from synchronous specifications
Asynchronous implementation techniques, which measure logic delays at run time and activate registers accordingly, are inherently more robust than their synchronous counterparts, which estimate worst-case delays at design time, and constrain the clock cycle accordingly. De-synchronization is a new paradigm to automate the design of asynchronous circuits from synchronous specifications, thus permitting widespread adoption of asynchronicity, without requiring special design skills or tools. In this paper, we first of all study different protocols for de-synchronization and formally prove their correctness, using techniques originally developed for distributed deployment of synchronous language specifications. We also provide a taxonomy of existing protocols for asynchronous latch controllers, covering in particular the four-phase handshake protocols devised in the literature for micro-pipelines. We then propose a new controller which exhibits provably maximal concurrency, and analyze the performance of desynchronized circuits with respect to the original synchronous optimized implementation. We finally prove the feasibility and effectiveness of our approach, by showing its application to a set of real designs, including a complete implementation of the DLX microprocessor architectur
Convolutional and tail-biting quantum error-correcting codes
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to
4096 states and minimum distances up to 10 are constructed as stabilizer codes
from classical self-orthogonal rate-1/n F_4-linear and binary linear
convolutional codes, respectively. These codes generally have higher rate and
less decoding complexity than comparable quantum block codes or previous
quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same
rate and error-correction capability and essentially the same decoding
algorithms are derived from these convolutional codes via tail-biting.Comment: 30 pages. Submitted to IEEE Transactions on Information Theory. Minor
revisions after first round of review
- …