![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 64 matches
- 2012
- Scott Aaronson:
Impossibility of succinct quantum proofs for collision-freeness. Quantum Inf. Comput. 12(1-2): 21-28 (2012) - Satyabrata Adhikari, Indranil Chakrabarty, Pankaj Agrawal:
Probabilistic secret sharing through noisy quantum channel. Quantum Inf. Comput. 12(3-4): 253-261 (2012) - Hamed Ahmadi, Chen-Fu Chiang:
Quantum phase estimation with arbitrary constant-precision phase shift operators. Quantum Inf. Comput. 12(9-10): 864-875 (2012) - Gorjan Alagic, Edgar A. Bering
:
Quantum algorithms for invariants of triangulated manifolds. Quantum Inf. Comput. 12(9-10): 843-863 (2012) - David Marcus Appleby, Ingemar Bengtsson, Stephen Brierley, Markus Grassl, David Gross, Jan-Åke Larsson:
The monomial representations of the Clifford group. Quantum Inf. Comput. 12(5-6): 404-431 (2012) - Rachel Bachman, Eric Fredette, Jessica Fuller, Michael Landry
, Michael Opperman, Christino Tamon, Andrew Tollefson:
Perfect state transfer on quotient graphs. Quantum Inf. Comput. 12(3-4): 293-313 (2012) - Paul Beame
, Widad Machmouchi:
The quantum query complexity of AC0. Quantum Inf. Comput. 12(7-8): 670-676 (2012) - Normand J. Beaudry, Renato Renner:
An intuitive proof of the data processing inequality. Quantum Inf. Comput. 12(5-6): 432-441 (2012) - G. P. Berman, D. I. Kamenev, D. Kinion, V. I. Tsifrinovich:
Non-demolition dispersive measurement of a superconducting qubit with a microstrip SQUID amplifier. Quantum Inf. Comput. 12(7-8): 541-552 (2012) - Dominic W. Berry, Andrew M. Childs:
Black-box hamiltonian simulation and unitary implementation. Quantum Inf. Comput. 12(1-2): 29-62 (2012) - Jan Bouda, Matej Pivoluska, Martin Plesch:
Encryption with weakly random keys using a quantum ciphertext. Quantum Inf. Comput. 12(5-6): 395-403 (2012) - Sergey Bravyi, Robert König:
Classical simulation of dissipative fermionic linear optics. Quantum Inf. Comput. 12(11-12): 925-943 (2012) - Aharon Brodutch, Kavan Modi:
Criteria for measures of quantum correlations. Quantum Inf. Comput. 12(9-10): 721-742 (2012) - William T. Buttler, Steven K. Lamoreaux, Justin R. Torgerson:
Practical four-dimensional quantum key distribution without entanglement. Quantum Inf. Comput. 12(1-2): 1-8 (2012) - Luis Octavio Castaños:
Steady-state correlations of two atoms interacting with a reservoir. Quantum Inf. Comput. 12(3-4): 231-252 (2012) - Indranil Chakrabarty, Pankaj Agrawal, Arun K. Pati:
Locally unextendible non-maximally entangled basis. Quantum Inf. Comput. 12(3-4): 271-282 (2012) - Andrew M. Childs, Nathan Wiebe:
Hamiltonian simulation using linear combinations of unitary operations. Quantum Inf. Comput. 12(11-12): 901-924 (2012) - Kota Chisaki, Norio Konno, Etsuo Segawa
:
Limit theorems for the discrete-time quantum walk on a graph with joined half lines. Quantum Inf. Comput. 12(3-4): 314-333 (2012) - Bao-Long Fang, Tao Wu, Liu Ye:
Realization of an economical phase-covariant telecloning in separate cavities. Quantum Inf. Comput. 12(3-4): 334-345 (2012) - Mark Fannes, Fernando de Melo, Wojciech Roga, Karol Zyczkowski:
Matrices of fidelities for ensembles of quantum states and the holevo quantity. Quantum Inf. Comput. 12(5-6): 472-489 (2012) - Austin G. Fowler:
Low-overhead surface code logical Hadamard. Quantum Inf. Comput. 12(11-12): 970-982 (2012) - Hachiro Fujita:
Quantum McEliece public-key cryptosystem. Quantum Inf. Comput. 12(3-4): 181-202 (2012) - François Le Gall, Shota Nakagawa, Harumichi Nishimura:
On QMA protocols with two short quantum proofs. Quantum Inf. Comput. 12(7-8): 589-600 (2012) - Artur García-Sáez, José Ignacio Latorre:
An exact tensor network for the 3SAT problem. Quantum Inf. Comput. 12(3-4): 283-292 (2012) - Dmitry Gavinsky:
Quantum predictive learning and communication complexity with single input. Quantum Inf. Comput. 12(7-8): 575-588 (2012) - Douglas Soares Gonçalves, Márcia A. Gomes-Ruggiero, Carlile Lavor, Osvaldo Jiménez Farias, P. H. Souto Ribeiro:
Local solutions of maximum likelihood estimation in quantum state tomography. Quantum Inf. Comput. 12(9-10): 775-790 (2012) - Giuliano Gadioli La Guardia:
On nonbinary quantum convolutional BCH codes. Quantum Inf. Comput. 12(9-10): 820-842 (2012) - Gábor Ivanyos:
Finding hidden Borel subgroups of the general linear group. Quantum Inf. Comput. 12(7-8): 661-669 (2012) - Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura:
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. Quantum Inf. Comput. 12(5-6): 461-471 (2012) - Brendan Juba:
On learning finite-state quantum sources. Quantum Inf. Comput. 12(1-2): 105-118 (2012)
skipping 34 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-18 08:43 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint