I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Efficient circuit implementation for coined quantum walks o..:
, In:
2022 IEEE/ACM 7th Symposium on Edge Computing (SEC)
,
Mullor, Thomas
;
Vigouroux, David
;
Bethune, Louis
- p. 436-443 , 2022
Link:
https://doi.org/10.1109/SEC54971.2022.00066
RT T1
2022 IEEE/ACM 7th Symposium on Edge Computing (SEC)
: T1
Efficient circuit implementation for coined quantum walks on binary trees and application to reinforcement learning
UL https://suche.suub.uni-bremen.de/peid=ieee-9996674&Exemplar=1&LAN=DE A1 Mullor, Thomas A1 Vigouroux, David A1 Bethune, Louis YR 2022 K1 Training K1 Quantum algorithm K1 Binary trees K1 Reinforcement learning K1 Games K1 Logic gates K1 Quantum circuit K1 Quantum walks K1 Quantum circuits SP 436 OP 443 LK http://dx.doi.org/https://doi.org/10.1109/SEC54971.2022.00066 DO https://doi.org/10.1109/SEC54971.2022.00066 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)