Tuesday, January 22

Wednesday, January 23

Thursday, January 24

Friday, January 25

Poster Session – Schedule:
The Programme Committee has accepted 150 posters, which will be presented in two poster sessions at the Lecture Hall (3rd floor), New Tsinghua Xuetang (which is just next to the Concert Hall) on Monday/Tuesday (21/22 January 2012) from 17:00-19:30.

Installation Instructions:
Each accepted poster will be assigned a panel, large enough to hold an A0 size poster (i.e. width 33.1 in = 84.1 cm, height 46.8 in = 118.9cm). In view of space constraints at the venue we require contributors to use portrait (tall) rather than landscape (wide) orientation.

Poster Awards:
Participants are invited to select posters for awards. The best poster will be determined by the participants’ votes on each day.

SESSION 1

3. Jun Zhou, Hpng-Yi Fan and Jun Song
A new type of photon-added squeezed coherent state and its statistical properties

4. Stacey Jeffery, Robin Kothari and Frederic Magniez
Improving the Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.

5. Michal Hajdusek and Mio Murao
Direct evaluation of pure graph state entanglement

6. Marco Tomamichel, Serge Fehr, Jedrzej Kaniewski and Stephanie Wehner
Strong Parallel Repetition for a Monogamy-of-Entanglement Game

7. Nathan Wiebe, Daniel Braun, Seth Lloyd
Quantum Data Fitting

9. Jianxin Chen and Andreas Winter
Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt)

11. Jordi Tura Brugués, Remigiusz Augusiak, Philipp Hyllus, Marek Kus, Jan Samsonowicz and Maciej Lewenstein
Entangled symmetric states of N qubits with all positive partial transpositions

12. Fernando de Melo, Piotr Cwiklinski and Barbara Terhal
The Power of Noisy Fermionic Quantum Computation

13. Carlos Fernández-González, Norbert Schuch, Michael M. Wolf, J. Ignacio Cirac and David Pérez-García
Gapless Hamiltonians for the toric code using the PEPS formalism

14. Robert Hübener, Andrea Mari and Jens Eisert
Wick’s theorem for matrix product states

15. Francesco Buscemi, Nilanjana Datta, Patrick Hayden, Min-Hsiu Hsieh, Mark Wilde and Andreas Winter
Communication costs of quantum measurement simulation and quantum-to-classical lossy data compression

16. Mario Berta, Omar Fawzi and Stephanie Wehner
Quantum to classical randomness extractors

17. Jedrzej Kaniewski, Marco Tomamichel, Esther Haenggi and Stephanie Wehner
Secure bit commitment from relativistic constraints

19. Tanvirul Islam and Stephanie Wehner
Computability limits non-local correlations

20. Michael Kastoryano, Michael Wolf and Jens Eisert
Precisely timing dissipative quantum information processing

21. Cécilia Lancien and Andreas Winter
Distinguishing multi-partite states by local measurements

22. Loïck Magnin and Jérémie Roland
Explicit relation between all lower bound techniques for quantum query complexity

23. Nilanjana Datta, Milan Mosonyi, Min-Hsiu Hsieh and Fernando Brandao
Strong converses for classical information transmission and hypothesis testing

24. Corsin Pfister and Stephanie Wehner
If no information gain implies no disturbance, then any discrete physical theory is classical

25. Hong Wei Li, Piotr Mirononwicz and Marcin Pawlowski
On the relation between semi and fully device independent protocols

26. Eyuri Wakakuwa and Mio Murao
Chain rule implies Tsirelson’s bound

27. Andris Ambainis and Ashley Montanaro
The quantum query complexity of combinatorial group testing

28. Cyril Stark
Simultaneous Estimation of Dimension, States and Measurements

29. Waldemar Klobus, Andrzej Grudka, Michal Horodecki, Pawel Horodecki, Ryszard Horodecki and Lukasz Pankowski
Mutual uncertainty

31. Yasuhiro Takahashi and Seiichiro Tani
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits

32. Jianxin Chen, Zhengfeng Ji, David Kribs and Bei Zeng
Minimum Entangling Powers are Maximum

33. Sergii Strelchuk, Michal Horodecki and Jonathan Oppenheim
Entanglement Recycling and Generalized Teleportation

34. Yi-Kai Liu, Steven Flammia, David Gross and Jens Eisert
A Restricted Isometry Theorem for Pauli Measurements, and the Sample Complexity of Tomography

36. Rahul Jain, Yaoyun Shi, Zhaohui Wei and Shengyu Zhang
Efficient protocols of generating bipartite classical distributions and quantum states

37. Andrew Childs, Debbie Leung, Laura Mancinska and Maris Ozols
A framework for bounding nonlocality of state discrimination

38. Abuzer Yakaryilmaz
Public-qubits versus private-coins

39. Laura Mancinska, Giannicola Scarpa and Simone Severini
New separations in zero-error channel capacity through projective Kochen-Specker sets and quantum coloring

40. Damián Pitalúa-García
Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle

41. Sofyan Iblisdir, Mauro Cirio, Octavi Boada and Gavin Brennen
Low Depth Quantum Circuits for Ising Models

42. Niel De Beaudrap
A linearized stabilizer formalism for systems of finite dimension

43. Yuchun Wu and Guang-Can Guo
Structure feature of Clauser-Horne-Shimony-Holt type Bell inequalities

44. Daniel Nagaj, Rolando Somma and Maria Kieferova
Quantum Speedup by Quantum Annealing

46. Peng Xue and Barry Sanders
Controlling and reversing the quantum-to-classical transition of a quantum walk by driving the coin

47. Xie Chen, Zheng-Cheng Gu, Zheng-Xin Liu and Xiao-Gang Wen
Many-body Entanglement in Symmetry Protected Topological Systems

48. Anne Marin and Damian Markham
Sharing quantum and classical secrets

49. Cedric Beny and Tobias Osborne
An information-theoretic formulation of the renormalization group

50. Yang Liu and Shengyu Zhang
Quantum and randomized communication complexity of XOR functions in the SMP model

51. Renato Renner, Vedran Dunjko, Joseph F Fitzsimons and Christopher Portmann
Composability of secure delegated quantum computation

52. Adam Bookatz, Pawel Wocjan, Stephen Jordan and Yi-Kai Liu
Testing quantum expanders is co-QMA-complete

53. Yaoyun Shi and Xiaodi Wu
Limits of quantum one-way communication by matrix Hypercontractive Inequalities

54. Damián Pitalúa-García
Quantum information causality

55. Salman Beigi
A New Quantum Data Processing Inequality

56. Salman Beigi and Amin Gohari
Information Theoretic Benefit of Entanglement in Classical Communication Settings

57. Cedric Beny and Tobias Osborne
Inverting the renormalization group

58. Matthew Coudron and Ramis Movassagh
Unfrustration Condition and Degeneracy of Qudits on Trees

59. Alex Arkhipov
Extending and Characterizing Quantum Magic Games

60. Philippe Faist, Frédéric Dupuis, Jonathan Oppenheim and Renato Renner
Quantitative Quantum Landauer’s Principle

61. John Smolin
The IBM Superconducting Quantum Computer Project: Experimental Achievements and Benchmarking

62. Matthew Amy, Dmitri Maslov, Michele Mosca and Martin Roetteler
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits

63. Andrzej Grudka, Michał Horodecki, Paweł Horodecki, Paweł Mazurek, Łukasz Pankowski and Anna Przysiężna
Long distance quantum communication over noisy networks.

64. Andrzej Grudka, Karol Horodecki, Michal Horodecki, Pawel Horodecki, Ryszard Horodecki, Pankaj Joshi, Waldemar Klobus and Antoni Wojcik
Quantifying contextuality

65. Hector J. Garcia, Igor L. Markov and Andrew W. Cross
Efficient Inner-product Algorithm for Stabilizer States

67. Isaac Kim
Perturbative analysis of topological entanglement entropy from conditional independence

68. Vadym Kliuchnikov, Dmitri Maslov and Michele Mosca
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates

69. Brittanney Amento, Martin Roetteler and Rainer Steinwandt
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity

70. Guillaume Duclos-Cianci and Krysta Svore
A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations

71. Jeongwan Haah
Commuting Pauli Hamiltonians as maps between free modules

72. Normand Beaudry, Stefano Mancini and Renato Renner
Security proof of two-way quantum key distribution protocols with partial device independence

74. Robin Blume-Kohout, Dylan Maher, Lee Rozema, Ardavan Darabi, Chris Ferrie and Aephraim Steinberg
The power of null-space sampling: Quadratic speedups for quantum estimation

SESSION 2

75. Gorjan Alagic, Stephen Jordan and Stacey Jeffery
Quantum and Classical Circuit Obfuscation with Braids

76. Laura Mancinska and David Roberson
Graph homomorphisms for quantum players

78. Jan Bouda, Matej Pivoluska, Martin Plesch and Colin Wilmott
Weak randomness seriously limits the security of QKD

79. Min Li, Yong-Sheng Zhang and Guang-Can Guo
Quantum random walk in periodic potential on a line

80. Fernando Iemini and Reinaldo O. Vianna
Computable Measures for the Entanglement of Indistinguishable Particles

81. Mateus Araújo, Marco Túlio Quintino, Costantino Budroni, Marcelo Terra Cunha and Adán Cabello
Complete characterization of the n-cycle noncontextual polytope

82. Robert Matjeschk, Andre Ahlbrecht, Albert Werner, Martin Enderlein, Christopher Cedzich, Michael Keyl, Tobias Schaetz and Reinhard Werner
Quantum Walks with Non-Orthogonal Position States

83. Courtney Brell
Universal Topologically Protected Adiabatic Cluster State Quantum Computation

84. Wieslaw Laskowski, Christian Schwemmer, Daniel Richart, Tomasz Paterek and Harald Weinfurter
Experimental Schmidt Decomposition and State Independent Entanglement Detection

86. Junghee Ryu, Marek Zukowski, James Lim and Jinhyoung Lee
Operational Quasiprobabilities for Qudits

87. Tobias Fritz, Ana Belén Sainz, Remigiusz Augusiak, Jonatan Bohr Brask, Rafael Chaves, Anthony Leverrier and Antonio Acin
Local Orthogonality: a multipartite principle for correlations

88. Shelby Kimmel and Marcus P. Da Silva
Robust Quantum Process Characterization Beyond Fidelity to Clifford Unitaries

89. David Reeb and Michael M. Wolf
(Im-)Proving Landauer’s Principle

90. Marcin Wiesniak, Mohamed Nawareg, Marek Zukowski and Koji Maruyama
Bell Inequalities with Lower Order Correlations

91. Thiago Maciel, André Cesário, Reinaldo Vianna, Carlile Lavor and Douglas Gonçalves
Analects on quantum tomographies and inference schemes.

92. Nelly Ng, Siddarth Joshi, Chen Ming Chia, Mario Berta, Christian Kurtsiefer and Stephanie Wehner
Experimental implementation of bit commitment in the noisy-storage model

93. Raqueline A. M. Santos and Renato Portugal
Simulations of Quantum Markov Chains on Percolation Graphs

95. Yingkai Ouyang and Wee Hao Ng
Truncated quantum channel representations for coupled harmonic oscillators

96. Ansis Rosmanis
Toward Adversary Bound for Element Distinctness with Small Range

97. Marco Piani, Tan K Chuan, Jean Maillard, Kavan Modi, Tomasz Paterek and Mauro Paternostro
Quantum discord bounds the amount of distributed entanglement

98. Yanbao Zhang, Scott Glancy and Emanuel Knill
Efficient quantification of experimental evidence against local realism

99. Tzyh Haur Yang, Miguel Navascues, Matthew McKague and Valerio Scarani
Robust Self Testing of Pure Entangled States

100. Phuc Thinh Le, Jeysthur Ang, Lana Sheridan and Valerio Scarani
Robustness of Bell inequalities against reduced “free will” attacks and its relation to Bell-based randomness expansion.

101. Thomas Lawson, Anna Pappa, Damian Markham, Iordanis Kerenidis and Eleni Diamanti
Adversarial entanglement verification without shared reference frames.

102. Anna Pappa, Thomas Lawson, André Chailloux, Eleni Diamanti and Iordanis Kerenidis
Adversarial Multipartite Entanglement Verification in realistic conditions.

103. Michele Dall’Arno, Elsa Passaro, Rodrigo Gallego and Antonio Acin
Robustness of Device Independent Dimension Witnesses.

104. Michele Dall’Arno, Elsa Passaro, Rodrigo Gallego, Marcin Pawlowski and Antonio Acin
Attacks on Semi-Device-Independent Quantum Protocols.

105. Ciara Morgan and Andreas Winter
Towards a strong converse for the quantum capacity of degradable channels

106. Adam Paetznick, Vinayak Pathak, Lucy Liuxuan Zhang and Austin Fowler
Surface code braid compaction

107. Mark Um, Xiang Zhang, Junhua Zhang, Yang-Chao Shen, Ye Wang, Dong-Ling Deng, Lu-Ming Duan and Kihwan Kim
Random Numbers Certified by Quantum Contextuality

108. Joseph M. Renes and David Sutter
Efficient Quantum Channel Coding Scheme Requiring No Preshared Entanglement

109. Frédéric Dupuis, Lea Kraemer, Philippe Faist, Joseph M. Renes and Renato Renner
Generalized Entropies

110. Adam Bouland and Scott Aaronson
Any Beam Splitter and Any Phase Generate Universal Quantum Linear Optics

111. Alex Bocharov, Yuri Gurevich and Krysta M. Svore
Decomposing a Single-Qubit Gate into an Efficiently Universal Basis

112. Matthew Wardrop
A Two-Qubit Exchange Gate Proposal for Singlet-Triplet Quantum Dot Qubits

113. Sania Jevtic, Matthew Pusey, David Jennings and Terry Rudolph
Visualizing two qubit states: the steering ellipsoid

114. Natasha Gabay and Nicolas Menicucci
Optical Continuous-Variable Cluster States as Schwinger Spin States

115. Xiang Zhang, Mark Um, Junhua Zhang, Shuoming An, Ye Wang, Dongling Deng, Chao Shen, Luming Duan and Kihwan Kim
State-independent quantum contextuality in an indivisible system.

116. Ramij Rahaman
Nonlocality test for Genuine Multipartite Entanglement without inequality.

117. Jacob Cale Bridgeman, Aroon O’Brien, Stephen D Bartlett and Andrew C Doherty
Simulating a Class of Critical Quantum Systems using Tensor Network Methods.

118. Poya Haghnegahdar and Robert Raussendorf
Transforming AKLT-like states to Graph-States (universal resources for measurement based quantum computation).

119. Rafael N. Alexander and Nicolas C. Menicucci
Efficient use of squeezing in continuous-variable cluster computing.

120. Andrew Darmawan and Stephen Bartlett
Producing an approximate qubit cluster state as the unique ground state of a deformed antiferromagnetic Hamiltonian.

121. Dominic Williamson and Stephen Bartlett
Quantum Computation Within Symmetry-Protected Topologically Ordered Phases of Spin Chains

122. Patrick Coles
Unification of different views of decoherence

123. Youngrong Lim, Mauro Paternostro, Minsu Kang, Jinhyoung Lee and Hyunseok Jeong
Power of macroscopic entanglement for detection-loophole free Bell test

124. Tommaso Federico Demarie, Gavin Brennen and Nicolas Menicucci
Topologically Ordered States with CV Modes on a 2D Lattice

125. Jinwoo Park, Mark Saunders, Yong-Il Shin, Kyungwon An and Hyunseok Jeong
Violation of local realism with entanglement between an atom and a coherent cavity field

127. Matthias Kleinmann, Costantino Budroni, Jan-Ake Larsson, Otfried Gühne and Adan Cabello
Optimal inequalities for state-independent contextuality

128. Dmitry Kravchenko
Expected Values of Some Random Nonlocal Games

129. Mauro Faccin, Zoltan Zimboras and Jacob Biamonte
Quantum Transport Enhancement by Time-Reversal Symmetry Breaking.

130. Dominic Berry, Richard Cleve and Sevag Gharibian
Gate-efficient discrete simulations of continuous-time quantum query algorithms.

132. Daniel Gottesman and Lucy Liuxuan Zhang
Fiber Bundle Framework for Unitary Fault Tolerance

133. Stefan Baeuml, Matthias Christandl and Andreas Winter
Limitations on privacy swapping

134. Francesco Petruccione and Ilya Sinayskiy
Microscopic derivation of open quantum walks

135. Joseph Bowles and Nicolas Brunner
Nonlocality vs computational power in graph states

136. Marco Túlio Quintino, Mateus Araújo, Daniel Cavalcanti, Colin Teo, Jiří Minář, Valerio Scarani, Adán Cabello, Marcelo França Santos and Marcelo Terra Cunha
Towards a loophole-free Bell test with continuous variables systems

137. Erik Woodhead
Security of BB84 based on the no-cloning theorem

138. Ritabrata Sengupta
EXTREMAL EXTENSIONS OF POSITIVE MAPS

139. Peter Lewis
Distinct quantum states can be compatible with a single state of reality

141. Kyungdeock Park, Robabeh Darabad, Jonathan Baugh and Raymond Laflamme
Implementation of Multiple Rounds Quantum Error Correction Using Nuclear and Electron Spins in the Solid State

142. Sandra Rankovic, Joseph Renes and Renato Renner
Entropic relations for time measurements on quantum clocks

143. Renato Portugal, Franklin Marquezino and Stefan Boettcher
Discrete-Time Quantum Walks on Fractals

144. Gemma De Las Cuevas and Toby Cubitt
NP-hard spin models can simulate any other model

146. Patrick Hayden, Kevin Milner and Mark Wilde
Two-message quantum interactive proofs and the quantum separability problem

147. Iryna Andriyanova, Denise Maurice and Jean-Pierre Tillich
Spatially coupled quantum LDPC codes

148. Noah Linden, Milan Mosonyi and Andreas Winter
The structure of Renyi entropic inequalities

149. Richard Kueng and David Gross
Stabilizer states are spherical 3-designs – with applications to quantum state distinguishability

150. Oleg Gittsovich, Juan Miguel Arrazola, Norbert Lütkenhaus, John M. Donohue, Jonathan Lavoie and Kevin J. Resch
Experimentally reliable entanglement verification

In consideration of the high formative value of the conference, the Organizing Committee of QIP2013 is planning to allocate part of the conference budget to the financial support of a limited number of students or postdocs.

The number of grants available and the amount of the funding will depend on the overall budget, on the merit of the applicants, and on the level of support needed.

The application for support is open to students and postdocs of all nationalities. The deadline for applying is November 15, 2012.

Applications should be submitted through the conference website. Each applicant will be asked to answer a few questions (cf. form A below) and to provide the contact information of her/his advisor or mentor, to whom a reference request will be made (cf. form B below). Note that, in order for an application to receive full consideration, both forms should be submitted before the deadline of November 15, 2012.

The selection will be guided by examining an applicant’s research record and the need for aid. It will be based on a scoring system that reflects those priorities. Each applicant will be evaluated a total score, which is the sum of three components: base score, need score, and impact score. The base score is based on the answers provided by the applicant in form A, while the need and impact scores are based on the answers provided by the reference in form B.

Form A for Travel Grant Applicants

Form B for Reference

Online Registration is now closed!

(You are recommended to register on site.)

The registration is completed only after the payment is made. Before that time, you can always update your information here using your registration ID.(Logout)

Registration Fees

Note: The registration fees do not include bank charges.

The registration fee for QIP 2013 covers:

1. Conference with coffee breaks;
2. Poster sessions with refreshments;
3. Banquet;
4. Rump session with buffet dinner

Payment Procedure

• Online Payment
  Online payment is available after you login in the online registration form. Please follow the instructions therein to make the payment on line when you register. The payment website certified by the PCI Security Standards Council.

• Payment by a Bank Transfer
  Registration fee can also be paid via bank transfer. The coordinates for the bank transfer are given below:

Beneficiary’s Name: TSINGHUA UNIVERSITY

Account No.: 00047108094001

Beneficiary’s Bank Name: The Bank of China, Head Office

Beneficiary’s Bank Address: No.1, Fuxingmen Nei Avenue, Beijing, PRC, 100818

Swift Code: BKCHCNBJ

Note:

1.Please do not forget to include your name, QIP 2013, and IIIS in the message when you make the payment. Upon receipt of your bank transfer, you will receive a notification by email.

2.It is not suggested to pay the registration fee by bank transfer if the payment is made after December 31, 2012. If you register after that time, we recommend that you pay online or pay the fee on-site.

3.If you have any question about the bank transfer payment, please contact iiis@tsinghua.edu.cn.

Registration before December 31, 2012

In order to avoid late registration fees, we recommend you to register before December 31^st(of before December 1^st if you would like to benefit of the early-bird registration rates). To benefit of the early-bird or regular rates, please register online and ensure that the payment is made before the corresponding deadline.

Note that online registration is completed only after you make the online payment or after you upload the receipt of your bank transfer.

To register, you can click on the link below:

Online Registration

Registration after December 31, 2012

Late registration fees apply for participants who do not complete their registration before December 31st. If you prefer to bank transfer your registration fee and cannot complete your registration before December 31^st, you can still make an on-site payment at the Conference Registration Desk starting on January 20^th 2013. However, the preferred option for on-site payment is by cash.

Please remind that you are required to register online even if you opt for on-site payment.

Substitution/Cancellation Policy

In case a registered participant is unable to attend the conference, s/he may send a substitute to attend the conference. In this case, we require the participant to inform the conference secretariat before 1st January 2013.

Cancellation must be made to the conference secretariat in writing either by letter, fax or email.

Before December 1, 2012 – Full refund of the registration fee

Between December 1 and December 15, 2012 – 50% refund of the registration fee

No refund will be made for cancellation after December 15, 2012.

Please note that the day we receive your notice will be considered as the day of your cancellation, and all refunds will be made after the conference. Bank charges for cancellation refunds will be borne by participants.

QIP 2013 Secretariat

Institute for Interdisciplinary Information Sciences

Room 1-208, FIT Building, Tsinghua University Beijing 100084, China

Email: iiis@tsinghua.edu.cn

Fax: +86-10 62797331

From October 5 (submission deadline for contributed talks) to November 9 (notification of acceptance for contributed talks), the EasyChair server will be closed to submissions.

The server will be re-opened to additional poster submissions during the period November 10-16. (Previous submitted abstracts labeled as “talk, if not accepted then poster” or “poster only” do not need to be re-submitted; they will automatically be considered for posters.)

Abstract submission for contributed talks

Contributed talks at QIP are intended to be representative of outstanding recent research contributions to the theory of quantum information and computation. Submissions to QIP for talks should consist of an extended abstract of at most 3 pages, containing a non-technical, clear, and insightful description of the results and main ideas, their potential impact, and their importance to quantum information and computation. (Extended abstracts should not consist of a compressed version of a full paper, but instead should facilitate an intuitive understanding of the research results they represent and help the program committee in assessing their importance.)

Extended abstracts must be submitted in PDF format, and be typeset in single-column form with reasonable margins and font size at least 11 points. The 3 page limit on submissions does not include references. Submissions deviating from these guidelines may be rejected without consideration of their merits.

In addition to the extended abstract, each submission must refer to a technical version of the work, either posted to an online repository, such as arXiv.org, or included with the submission as an attachment. (Referral to an online repository is strongly preferred.) The program committee will consider technical versions of submissions at its discretion only.

Abstract submission for posters

Poster submissions should consist of an extended abstract following the same guidelines as for contributed talk submissions. A referral to a technical version is not required for poster submissions.

Instructions for submissions

All submissions must be made electronically through the online submission system EasyChair.

To submit an abstract please login at the webpage

https://www.easychair.org/account/signin.cgi?conf=qip2013

(EasyChair account needed)

Dates

Submission deadline for talks:         October 5, 2012
Notification for talk submissions:      November 9, 2012
Submission deadline for posters:     November 16, 2012
Notification for poster submissions:  November 26, 2012

Program committee

Salman Beigi (IPM)
Gilles Brassard (Université de Montréal)
Andrew Childs (University of Waterloo)
Matthias Christandl (ETH Zurich)
Toby Cubitt (Universidad Complutense de Madrid)
Michał Horodecki (University of Gdańsk)
Tsuyoshi Ito (NEC Laboratories America, Inc.)
Stephen Jordan (NIST)
Troy Lee (CQT, National University of Singapore)
Norbert Lütkenhaus (University of Waterloo)
David Perez-Garcia (Universidad Complutense de Madrid)
David Poulin (Université de Sherbrooke)
John Preskill (Caltech)
Barbara Terhal (RWTH Aachen)
John Watrous (University of Waterloo)(chair)
Mark M. Wilde (McGill University)
Bei Zeng (University of Guelph)

• International Participants may need a visa to attend QIP 2013 in Beijing. For more information about the visas, you may visit the webpage http://www.fmprc.gov.cn/eng/ljzg/3647/3648/t18417.htm. It is also greatly suggested to consult your nearest Chinese consular representation the documents required to get a visa.

• If you need an invitation letter, please register first at this link and then use your registration ID to make a request online. A signed invitation letter will be sent to you via email in a couple of days after the request is made. Please note that only an Invitation Letter of Duly Authorized Unit includes your personal information in your passport.

• To get the visa, you will need to submit an application to the nearest Chinese Consulate or Visa Center in your country. The process generally takes a few days (normally from two days to one week, depending on which visa service you use). In most cases, the Consulate/Visa Center will keep your passport during that time. Please take this into account when you plan your trip(s), and allow sufficient time to go through the application process comfortably.

Transportation from Beijing Capital International Airport to Conference Venue

By Taxi

The simplest option to get to Tsinghua University is to take a taxi. It costs 10 CNY (1.33 USD) for the first three kilometers and 2 CNY (0.27 USD) per kilometer thereafter. An additional fuel fee of 3 CNY will be charged.

From Capital Airport to Tsinghua it will cost around 120 CNY. The trip usually takes 45 minutes. However, it may take more during rush hours (8:00am-10:00am and 4:30pm-7:00pm).

As most taxi drivers do not speak English, we recommend you to print the address of your hotel in Chinese characters.

If you wish to get to the conference venue in Tsinghua University, you can show the following Chinese note to the driver:

By Airport Shuttle

Airport Bus provides a much cheaper way to get to your destination. If you like this option, you can take Line 5 Bus (costs 16 CNY/person = 2.5 dollars) outside the airport and get off at the Zhongguancun Bridge station of this route. You might need the following picture if you do not know how to explain that you want to get off at Zhongguancun Bridge. Please print it out and show it to the driver. After you get off, you need to take a taxi to Tsinghua.

By Airport Express and Subway

The Airport Express is faster than shuttle bus and cheaper than taxi. It costs 25 CNY for a single trip/person. Please transfer at the stop of Dongzhimen to Line 13 (An additional 2 CNY) and then get off at the stop of Wudaokou. It takes 20 minutes from Wudaokou to Tsinghua by walk and the map below shows the way.

More transportation information can be found at http://www.beijing-airport-transportation.com/