Ernesto F. Galvao

Ernesto F. Galvao

Auto-generated profile, based on publicly available information

Ernesto F. Galvao

International Iberian Nanotechnology Laboratory (INL)

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2013 in Nature Photonics
Verified
Journal Article
Closed access
PDF file
ACAndrea Crespi
Andrea Crespi
Roberto OsellameRoberto Osellame
Roberto Osellame
RRRoberta Ramponi
Roberta Ramponi
DBDaniel J. Brod
Daniel J. Brod
EGErnesto F. Galvão
Ernesto F. Galvão
Fabio SciarrinoFabio Sciarrino
Fabio Sciarrino

22 June 2014 in Nature Photonics
Verified
Journal Article
Closed access
PDF file
NSNicolò Spagnolo
Nicolò Spagnolo
CVChiara Vitelli
Chiara Vitelli
MBMarco Bentivegna
Marco Bentivegna
DBDaniel J. Brod
Daniel J. Brod
ACAndrea Crespi
Andrea Crespi
Fabio SciarrinoFabio Sciarrino
Fabio Sciarrino

3 April 2015 in Science Advances
Verified
Journal Article
Open access
PDF file
MBMarco Bentivegna
Marco Bentivegna
NSNicolò Spagnolo
Nicolò Spagnolo
CVChiara Vitelli
Chiara Vitelli
FFFulvio Flamini
Fulvio Flamini
NVNiko Viggianiello
Niko Viggianiello
Fabio SciarrinoFabio Sciarrino
Fabio Sciarrino
A novel experiment supports quantum computation using photonic circuits to greatly increase quantum device speed.

1 May 2019 in Advanced Photonics
Verified
Journal Article
Open access
PDF file
DBDaniel J. Brod
Daniel J. Brod
EGErnesto F. Galvão
Ernesto F. Galvão
ACAndrea Crespi
Andrea Crespi
RORoberto Osellame
Roberto Osellame
NSNicolò Spagnolo
Nicolò Spagnolo
FSFabio Sciarrino
Fabio Sciarrino
In recent years, much work has been directed to the development of suitable technologies for scalable quantum computation. This effort is motivated by the promise of quantum algorithmic speed-up, with a notable early example provided by Shor’s algorithm for integer factoring.1 Despite the tremendous advances in quantum technologies2 3. 4. 5. 6. – 7 reported in the last few years, the implementation of a large-scale universal quantum computer is still far from our current capabilities. Hence, intermediate milestones need to be identified in the long-term effort toward harnessing the computational potential of quantum systems. A first fundamental step in this direction would be the achievement of the regime of quantum computational supremacy,8 i.e., the experimental demonstration of a quantum device capable of performing a computational task unambiguously faster than present-day classical computers.

3 January 2006 in Physical Review A
Verified
Journal Article
Closed access
PDF file
CCCecilia Cormick
Cecilia Cormick
EGErnesto F. Galvão
Ernesto F. Galvão
DGDaniel Gottesman
Daniel Gottesman
JPJuan Pablo Paz
Juan Pablo Paz
APArthur O. Pittenger
Arthur O. Pittenger
Gibbons et al., [Phys. Rev. A 70, 062101 (2004)] have recently defined discrete Wigner functions W to represent quantum states in a Hilbert space with finite dimension. We show that such a class of Wigner functions W can be defined so that the only pure states having non-negative W for all such functions are stabilizer states, as conjectured by Galvão, [Phys. Rev. A 71, 042302 (2005)]. We also show that the unitaries preserving non-negativity of W for all definitions of W in the class form a subgroup of the Clifford group. This means pure states with non-negative W and their associated unitary dynamics are classical in the sense of admitting an efficient classical simulation scheme using the stabilizer formalism.

1 April 2005 in Physical Review A
Verified
Journal Article
Closed access
PDF file
EGErnesto F. Galvão
Ernesto F. Galvão
Gibbons et al. [Phys. Rev. A 70, 062101 (2004)] have recently defined a class of discrete Wigner functions W to represent quantum states in a finite Hilbert space dimension d. I characterize the set Cd of states having non-negative W simultaneously in all definitions of W in this class. For d⩽5 I show Cd is the convex hull of stabilizer states. This supports the conjecture that negativity of W is necessary for exponential speedup in pure-state quantum computation.