Sciweavers

164 search results - page 3 / 33
» The Learnability of Quantum States
Sort
View
CORR
2006
Springer
76views Education» more  CORR 2006»
13 years 7 months ago
The Quantum Separability Problem for Gaussian States
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider th...
Stefano Mancini, Simone Severini
ENTCS
2008
125views more  ENTCS 2008»
13 years 7 months ago
Quantum Arrows in Haskell
We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and ...
Juliana Kaizer Vizzotto, Antônio Carlos da R...
ENTCS
2006
117views more  ENTCS 2006»
13 years 7 months ago
Reasoning About Imperative Quantum Programs
A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
ENTCS
2007
174views more  ENTCS 2007»
13 years 7 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
ISCAS
2003
IEEE
126views Hardware» more  ISCAS 2003»
14 years 9 days ago
High-speed processor for quantum-computing emulation and its applications
A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this pr...
Minoru Fujishima, Kaoru Saito, M. Onouchi, Koichir...