Остановите войну!
for scientists:
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 58 matches
- 2017
- Gorjan Alagic, Catharine Lo:
Quantum invariants of 3-manifolds and NP vs #P. Quantum Inf. Comput. 17(1&2): 125-141 (2017) - Pablo Arrighi, Stefano Facchini:
(3+1) dimensions, and beyond. Quantum Inf. Comput. 17(9&10): 794-824 (2017) - Srinivasan Arunachalam, Ronald de Wolf:
Optimizing the number of gates in quantum search. Quantum Inf. Comput. 17(3&4): 251-261 (2017) - Elizabeth C. Behrman, James Edward Steck, Mohamed A. Moustafa:
Learning quantum annealing. Quantum Inf. Comput. 17(5&6): 469-487 (2017) - Nikolas P. Breuckmann, Kasper Duivenvoorden, Dominik Michels, Barbara M. Terhal:
Local decoders for the 2D and 4D toric code. Quantum Inf. Comput. 17(3&4): 181-208 (2017) - Stephen Brierley:
Efficient implementation of quantum circuits with limited qubit interactions. Quantum Inf. Comput. 17(13&14): 1096-1104 (2017) - Jop Briët, Jeroen Zuiddam:
Orthogonal rank and impossibility of quantum round elimination. Quantum Inf. Comput. 17(1&2): 106-116 (2017) - Kaifeng Bu, Chunhe Xiong:
A note on cohering power and de-cohering power. Quantum Inf. Comput. 17(13&14): 1206-1220 (2017) - Yudong Cao, Sabre Kais:
Efficient optimization of perturbative gadgets. Quantum Inf. Comput. 17(9&10): 779-793 (2017) - Rupak Chatterjee, Ting Yu:
Generalized coherent states, reproducing kernels, and quantum support vector machines. Quantum Inf. Comput. 17(15&16): 1292-1306 (2017) - Andrew M. Childs, Tongyang Li:
Efficient simulation of sparse Markovian quantum dynamics. Quantum Inf. Comput. 17(11&12): 901-947 (2017) - Anirban Narayan Chowdhury, Rolando D. Somma:
Quantum algorithms for Gibbs sampling and hitting-time estimation. Quantum Inf. Comput. 17(1&2): 41-64 (2017) - Andrea Coladangelo:
Parallel self-testing of (tilted) EPR pairs via copies of (tilted) CHSH and the magic square game. Quantum Inf. Comput. 17(9&10): 831-865 (2017) - Gabriel Coutinho, Chris D. Godsil:
Perfect state transfer is poly-time. Quantum Inf. Comput. 17(5&6): 495-502 (2017) - Gabriel Coutinho, Krystal Guo, Christopher M. van Bommel:
Pretty good state transfer between internal nodes of paths. Quantum Inf. Comput. 17(9&10): 825-830 (2017) - Francisco Delgado:
Two-qubit quantum gates construction via unitary factorization. Quantum Inf. Comput. 17(9&10): 721-746 (2017) - Krzysztof Domino, Adam Glos, Mateusz Ostaszewski:
Superdiffusive quantum stochastic walk definable on arbitrary directed graph. Quantum Inf. Comput. 17(11&12): 973-986 (2017) - Friederike Anna Dziemba:
Robustness of QMA against witness noise. Quantum Inf. Comput. 17(13&14): 1167-1190 (2017) - Jihao Fan, Yonghui Li, Min-Hsiu Hsieh, Hanwu Chen:
On quantum tensor product codes. Quantum Inf. Comput. 17(13&14): 1105-1122 (2017) - Máté Farkas, Péter Vrana:
Qudit homological product codes. Quantum Inf. Comput. 17(11&12): 948-958 (2017) - Kuo Hai, Yunrong Luo, Guishu Chong, Hao Chen, Wenhua Hai:
Analytical evidence of ultrafast generation of spin-motion entanglement. Quantum Inf. Comput. 17(5&6): 456-468 (2017) - Thomas Häner, Martin Roetteler, Krysta M. Svore:
Factoring using $2n+2$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7&8): 673-684 (2017) - Anna-Lena Hashagen:
Universal asymmetric quantum cloning revisited. Quantum Inf. Comput. 17(9&10): 747-778 (2017) - Matthew B. Hastings:
Turning gate synthesis errors into incoherent errors. Quantum Inf. Comput. 17(5&6): 488-494 (2017) - Matthew B. Hastings:
Small Majorana fermion codes. Quantum Inf. Comput. 17(13&14): 1191-1205 (2017) - Matthew B. Hastings:
Weight reduction for quantum codes. Quantum Inf. Comput. 17(15&16): 1307-1334 (2017) - Yusuke Higuchi, Etsuo Segawa:
Spreading behavior of quantum walks induced by random walks. Quantum Inf. Comput. 17(5&6): 399-414 (2017) - Fang-Yu Hong, Jing-Li Fu, Yan Wu, Zhi-Yan Zhu:
Electrical control of strong spin-phonon coupling in a carbon nanotube. Quantum Inf. Comput. 17(1&2): 117-124 (2017) - Nedasadat Hosseinidehaj, Robert A. Malaney:
CV-MDI quantum key distribution via satellite. Quantum Inf. Comput. 17(5&6): 361-379 (2017) - Martin Idel, Robert König:
On quantum additive Gaussian noise channels. Quantum Inf. Comput. 17(3&4): 283-302 (2017)
skipping 28 more matches
loading more results
failed to load more results, please try again later
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 2024-05-08 16:53 CEST 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