BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.17.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Ashoka University
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250221
DTEND;VALUE=DATE:20250223
DTSTAMP:20250221T070933Z
CREATED:20250209T124329Z
LAST-MODIFIED:20250221T070933Z
UID:73094-1740096000-1740268799@www.ashoka.edu.in
SUMMARY:SCDLDS Short courses on Quantum Computation and Causal Inference
DESCRIPTION:Short Courses Announcement\n\n\n\n\n \n\nFrom classical randomized to quantum computation\nJaikumar Radhakrishnan \nDistinguished Professor\nInternational Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru \n\n\nAbstract: We will introduce classical deterministic computation as processing information stored in the form of bits and acted upon by logical gates. Using this model we will describe how simple tasks are performed on the computer. We will introduce elements in our circuits whose actions are random and modelled by specifying probabilities\, and study the resulting model of randomized computation using linear algebraic notation and terminology\, analogous to the ones used in quantum computation. We will study the circuit framework for quantum computation and note where it is similar and fundamentally different from classical randomized computation. We will illustrate the power of quantum computation by describing quantum algorithms\, games and protocols that appear to outperform their classical counterparts. We will not expect prior familiarity with quantum physics or computer science. Our discussion will be accessible to anyone comfortable with algebra and probability at the level of first-year undergraduate courses.\n  \nBio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory\, randomness and computation\, quantum information and computation\, combinatorics\, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985\, and his PhD in Computer Science from Rutgers University\, NJ\, USA\, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru.\n\n\n\n \n\nIntroduction to causal inference\nPiyush Srivastava \nAssociate Professor\nSchool of Technology and Computer Science\, Tata Institute of Fundamental Research \n\n\nAbstract: Observations show a correlation between whether an individual smokes and whether they develop lung disease. But how does not formally establish that this implies that smoking can “cause” lung disease? We will discuss how questions like this have been formalized in statistics\, especially using the language of probabilistic graphical models. If time permits\, we will also discuss some open questions regarding the computational aspects of these formalizations.\n  \nBio: Piyush Srivastava is a faculty member at the School of Technology and Computer Science (STCS)\, Tata Institute of Fundamental Research (TIFR). His research broadly explores the application of probabilistic methods in computer science. Before joining TIFR\, he earned his undergraduate degree from IIT Kanpur\, followed by graduate studies at UC Berkeley. He also worked as a postdoctoral scholar at Caltech.\n\n\n\nSchedule: \n\n\nFebruary 21\, 2025:  \n\n\nJaikumar Radhakrishnan: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Quantum Computation) \n\n\nPiyush Srivastava: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Causal Inference) \n\n\n\n\nFebruary 22\, 2025: \n\n\nPiyush Srivastava: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Causal Inference) \n\n\nJaikumar Radhakrishnan: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Quantum Computation) \n\n\n\n\nclick here to download the schedule \n\nRegistration link: https://forms.gle/PzToLmB9LdKHfsds6\nDate: 21-22 February\, 2025\nVenue: AC-02-LR-007 (Takshila Hall)\nZoom link: https://zoom.us/j/99234288227?pwd=NQbY53EZSFhew8HuyFN5tro7wUbAd0.1\nFor details: ashoka-cdlds@ashoka.edu.in\nContact: +91-9136857558\nWebsite: https://cdlds.ashoka.edu.in/
URL:https://www.ashoka.edu.in/event/scdlds-sc01/
CATEGORIES:Online Event,Offline
ATTACH;FMTTYPE=image/png:https://www.ashoka.edu.in/wp-content/uploads/2025/02/sc01-bannerimage_v2.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250221T084500
DTEND;TZID=Asia/Kolkata:20250221T181500
DTSTAMP:20250220T065339Z
CREATED:20250212T060150Z
LAST-MODIFIED:20250220T065339Z
UID:73277-1740127500-1740161700@www.ashoka.edu.in
SUMMARY:SCDLDS Short course on Quantum Computing and Causal Inference
DESCRIPTION:Short Courses Announcement\n\n \n\n \n\nFrom classical randomized to quantum computation\nJaikumar Radhakrishnan \nDistinguished Professor International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru \n\n\nAbstract: We will introduce classical deterministic computation as processing information stored in the form of bits and acted upon by logical gates. Using this model we will describe how simple tasks are performed on the computer. We will introduce elements in our circuits whose actions are random and modelled by specifying probabilities\, and study the resulting model of randomized computation using linear algebraic notation and terminology\, analogous to the ones used in quantum computation. We will study the circuit framework for quantum computation and note where it is similar and fundamentally different from classical randomized computation. We will illustrate the power of quantum computation by describing quantum algorithms\, games and protocols that appear to outperform their classical counterparts. We will not expect prior familiarity with quantum physics or computer science. Our discussion will be accessible to anyone comfortable with algebra and probability at the level of first-year undergraduate courses.\n  \nBio: Jaikumar Radhakrishnan is a theoretical computer scientist with research interests in complexity theory\, randomness and computation\, quantum information and computation\, combinatorics\, and information theory. Radhakrishnan obtained his BTech in Computer Science and Engineering from IIT Kharagpur in 1985\, and his PhD in Computer Science from Rutgers University\, NJ\, USA\, in 1991. He joined the Tata Institute of Fundamental Research in 1991; in 2024 he moved to the International Centre for Theoretical Sciences (ICTS-TIFR)\, Bengaluru.\n\n \n\n \n\nIntroduction to causal inference\nPiyush Srivastava \nAssociate Professor School of Technology and Computer Science\, Tata Institute of Fundamental Research \n\n\nAbstract: Observations show a correlation between whether an individual smokes and whether they develop lung disease. But how does not formally establish that this implies that smoking can "cause" lung disease? We will discuss how questions like this have been formalized in statistics\, especially using the language of probabilistic graphical models. If time permits\, we will also discuss some open questions regarding the computational aspects of these formalizations.\n  \nBio: Piyush Srivastava is a faculty member at the School of Technology and Computer Science (STCS)\, Tata Institute of Fundamental Research (TIFR). His research broadly explores the application of probabilistic methods in computer science. Before joining TIFR\, he earned his undergraduate degree from IIT Kanpur\, followed by graduate studies at UC Berkeley. He also worked as a postdoctoral scholar at Caltech.\n\nSchedule: \n\n\nFebruary 21\, 2025:  \n\n\nJaikumar Radhakrishnan: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Quantum Computation) \n\n\nPiyush Srivastava: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Causal Inference) \n\n\n\n\nFebruary 22\, 2025: \n\n\nPiyush Srivastava: 10:00 AM – 11:00 AM\, 11:30 AM to 12:30 PM (Causal Inference) \n\n\nJaikumar Radhakrishnan: 2:30 PM-3:30 PM\, 4:00 PM-5:00 PM (Quantum Computation) \n		Click here to download the schedule\n\n\n\n\nRegistration link: https://forms.gle/PzToLmB9LdKHfsds6\nDate: 21-22 February\, 2025\nVenue: AC-02-LR-007\nFor details\, write to: ashoka-cdlds@ashoka.edu.in\nContact: +91-9136857558\nWebsite: https://cdlds.ashoka.edu.in/
URL:https://www.ashoka.edu.in/event/scdlds-short-course-on-quantum-computing-and-causal-inference/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250221T133000
DTEND;TZID=Asia/Kolkata:20250221T150000
DTSTAMP:20250212T053432Z
CREATED:20250212T053432Z
LAST-MODIFIED:20250212T053432Z
UID:73272-1740144600-1740150000@www.ashoka.edu.in
SUMMARY:Physics Seminar
DESCRIPTION:Abstract: Quantum sensing is regarded as one of the cornerstones of modern quantum science and technology that are poised to drive new technological advancements of this century while enhancing our understanding of fundamental sciences. Spin\, a quantum mechanical property\, associated with certain point defects in solid state materials has emerged as an excellent probe for sensing physical quantities with high sensitivity. Nitrogen-vacancy (NV) point defect in diamond is a leading candidate for quantum sensing of external magnetic field with high sensitivity and unprecedented spatial resolution at ambient conditions. This talk will try to cover the NV-based magnetic field sensing schemes\, current state of the art sensitivity with its limitations\, and future prospects of this technology. \nAbout the Speaker: Vinaya is currently a post-doctoral fellow at the Institute for Quantum Science and Technology\, University of Calgary\, Canada. His current research is broadly based on quantum nanophotonics\, with a focus on enhanced quantum sensing\, single-spin spectroscopy\, and creating interfaces for light-matter interactions in diamond. He completed his MSc in Physics from Mangalore University and his PhD from the Max Planck Institute for Biophysical Chemistry in Germany\, where he worked on diamond-based quantum sensing.
URL:https://www.ashoka.edu.in/event/physics-seminar/
END:VEVENT
END:VCALENDAR